Searched refs:previous (Results 1 - 25 of 119) sorted by relevance

12345

/haiku/src/servers/app/
H A DWindowList.cpp20 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/src/system/libroot/posix/pthread/
H A Dpthread_cleanup.cpp17 handler->previous = thread->cleanup_handlers;
33 thread->cleanup_handlers = handler->previous;
/haiku/src/add-ons/kernel/drivers/network/ether/pegasus/
H A Ddevlist.c56 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/src/system/kernel/debug/
H A Ddebug_heap.cpp27 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/headers/private/kernel/util/
H A DDoublyLinkedQueue.h183 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;
241 sGetLink(elLink->previous)->next = elLink->next;
244 sGetLink(elLink->next)->previous = elLink->previous;
[all...]
H A DMultiHashTable.h138 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;
/haiku/src/system/libnetwork/
H A Dgetifaddrs.cpp54 _getifaddrs(int domain, char* buffer, size_t len, struct ifaddrs** previous) argument
78 current->ifa_next = *previous;
79 *previous = current;
147 struct ifaddrs* previous = NULL; local
149 if (_getifaddrs(AF_INET, buffer.Get(), buflen, &previous) < 0 &&
151 freeifaddrs(previous);
154 if (_getifaddrs(AF_INET6, buffer.Get(), buflen, &previous) < 0 &&
156 freeifaddrs(previous);
159 if (_getifaddrs(AF_LINK, buffer.Get(), buflen, &previous) < 0 &&
161 freeifaddrs(previous);
[all...]
/haiku/src/apps/mediaplayer/support/
H A DCommand.cpp63 Command::UndoesPrevious(const Command* previous) argument
77 Command::CombineWithPrevious(const Command* previous) argument
H A DCommand.h30 virtual bool UndoesPrevious(const Command* previous);
32 virtual bool CombineWithPrevious(const Command* previous);
/haiku/src/system/libroot/os/arch/generic/
H A Dgeneric_stack_trace.cpp34 addr_t previous; member in struct:stack_frame
45 basePointer = frame->previous;
/haiku/src/system/libroot/os/arch/ppc/
H A Dstack_trace.cpp32 addr_t previous; member in struct:stack_frame
43 basePointer = frame->previous;
/haiku/src/apps/haikudepot/edits_generic/
H A DUndoableEdit.cpp62 UndoableEdit::UndoesPrevious(const UndoableEdit* previous) argument
76 UndoableEdit::CombineWithPrevious(const UndoableEdit* previous) argument
H A DUndoableEdit.h27 virtual bool UndoesPrevious(const UndoableEdit* previous);
30 const UndoableEdit* previous);
/haiku/src/apps/icon-o-matic/generic/command/
H A DCommand.cpp63 Command::UndoesPrevious(const Command* previous) argument
77 Command::CombineWithPrevious(const Command* previous) argument
H A DCommand.h30 virtual bool UndoesPrevious(const Command* previous);
32 virtual bool CombineWithPrevious(const Command* previous);
/haiku/src/kits/debug/arch/m68k/
H A Darch_debug_support.cpp13 struct stack_frame *previous; member in struct:stack_frame
/haiku/src/add-ons/kernel/file_systems/ntfs/libntfs/
H A Dcache.c107 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...]
/haiku/src/system/kernel/scheduler/
H A Dscheduler_tracing.h82 ScheduleThread(Thread* thread, Thread* previous) argument
85 fPreviousID(previous->id),
86 fCPU(previous->cpu->cpu_num),
88 fPreviousState(previous->state),
89 fPreviousWaitObjectType(previous->wait.type)
99 fPreviousWaitObject = previous->wait.object;
/haiku/src/system/kernel/slab/
H A DObjectDepot.cpp44 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/src/add-ons/kernel/file_systems/nfs4/
H A DRPCServer.cpp446 ServerNode* previous = NULL; local
455 previous = current;
458 previous = current;
466 if (previous == NULL)
469 if (previous->fID < node->fID)
470 previous->fRight = NULL;
472 previous->fLeft = NULL;
474 if (previous->fID < node->fID)
475 previous->fRight = current->fLeft;
477 previous
508 ServerNode* previous = NULL; local
[all...]
H A DCookie.cpp113 RequestEntry* previous = NULL; local
116 if (previous == NULL)
119 previous->fNext = entry->fNext;
124 previous = entry;
174 OpenFileCookie::RemoveLock(LockInfo* lock, LockInfo* previous) argument
176 if (previous != NULL)
177 previous->fCookieNext = lock->fCookieNext;
179 ASSERT(previous == NULL && fLocks == lock);
/haiku/src/kits/debug/arch/x86/
H A Darch_debug_support.cpp13 struct stack_frame *previous; member in struct:stack_frame
48 stackFrameInfo->parent_frame = stackFrame.previous;
/haiku/src/kits/debug/arch/x86_64/
H A Darch_debug_support.cpp14 struct stack_frame *previous; member in struct:stack_frame
49 stackFrameInfo->parent_frame = stackFrame.previous;
/haiku/src/kits/debug/arch/sparc/
H A Darch_debug_support.cpp14 struct stack_frame *previous; member in struct:stack_frame
49 stackFrameInfo->parent_frame = stackFrame.previous;
/haiku/src/kits/debug/arch/riscv64/
H A Darch_debug_support.cpp14 struct stack_frame *previous; member in struct:stack_frame
51 stackFrameInfo->parent_frame = stackFrame.previous;

Completed in 265 milliseconds

12345