| /haiku/src/kits/app/ |
| H A D | MessageAdapter.cpp | 513 uint8 *previous = pointer; local
525 *fieldSize = (uint8)(pointer - previous);
527 *(ssize_t *)fieldSize = (pointer - previous);
|
| /haiku/src/kits/debug/arch/m68k/ |
| H A D | arch_debug_support.cpp | 13 struct stack_frame *previous; member in struct:stack_frame
|
| /haiku/src/kits/debug/arch/sparc/ |
| H A D | arch_debug_support.cpp | 14 struct stack_frame *previous; member in struct:stack_frame
49 stackFrameInfo->parent_frame = stackFrame.previous;
|
| /haiku/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/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/src/kits/game/ |
| H A D | GameProducer.cpp | 37 _gs_play* previous; member in struct:_gs_play
|
| /haiku/src/kits/media/ |
| H A D | RealtimeAlloc.cpp | 47 FreeChunk* previous = NULL);
156 FreeChunk::Remove(rtm_pool* pool, FreeChunk* previous) argument
158 if (previous == NULL) {
159 // find the previous chunk in the list
163 previous = chunk;
171 previous->fNext = fNext;
|
| /haiku/src/kits/tracker/ |
| H A D | GroupedMenu.cpp | 297 TMenuItemGroup* previous = GroupAt(groupIndex - 1); local
298 group->fFirstItemIndex = previous->fFirstItemIndex
299 + previous->fItemsTotal;
|
| /haiku/src/preferences/screensaver/ |
| H A D | ScreenCornerSelector.h | 45 screen_corner previous) const;
|
| /haiku/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...] |
| H A D | WindowList.h | 58 Window* previous; member in struct:window_anchor
|
| /haiku/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...] |
| H A D | debug_paranoia.cpp | 153 ParanoiaCheck* previous = fChecks; local
154 while (previous != NULL && previous->fNext != check)
155 previous = previous->fNext;
157 // if previous is NULL (which it shouldn't be), just crash here
158 previous->fNext = check->fNext;
|
| /haiku/src/system/kernel/scheduler/ |
| H A D | scheduler_tracing.h | 82 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 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/src/system/libroot/os/arch/generic/ |
| H A D | generic_stack_trace.cpp | 34 addr_t previous; member in struct:stack_frame
45 basePointer = frame->previous;
|
| /haiku/src/system/libroot/os/arch/ppc/ |
| H A D | stack_trace.cpp | 32 addr_t previous; member in struct:stack_frame
43 basePointer = frame->previous;
|
| /haiku/src/system/libroot/os/ |
| H A D | debug.c | 198 bool previous = _rtDebugFlag; local
200 return previous;
|
| /haiku/src/system/libroot/posix/glibc/include/arch/ppc/ |
| H A D | sysdep.h | 125 .previous; \
137 .previous; \
|
| /haiku/src/system/libroot/posix/glibc/include/arch/sparc/ |
| H A D | sysdep.h | 35 .previous; \
|
| /haiku/src/system/libroot/posix/pthread/ |
| H A D | pthread_cleanup.cpp | 17 handler->previous = thread->cleanup_handlers;
33 thread->cleanup_handlers = handler->previous;
|
| /haiku/src/tests/add-ons/kernel/kernelland_emu/ |
| H A D | lock.cpp | 431 rw_lock_waiter* previous = NULL; local
434 previous = other;
438 if (previous == NULL) {
445 previous->next = waiter.next;
447 lock->waiters->last = previous;
|
| /haiku/src/tests/system/kernel/device_manager/playground/ |
| H A D | device_manager.cpp | 158 device_node* previous = NULL);
160 status_t _RegisterDynamic(device_node* previous = NULL);
1382 float& bestSupport, device_node* previous)
1385 bestSupport = previous != NULL ? previous->fSupportsParent : 0.0f;
1390 if (previous != NULL && driver == previous->DriverModule()) {
1452 device_node::_RegisterDynamic(device_node* previous) argument
1469 _FindBestDriver(path.Path(), bestDriver, bestSupport, previous);
1482 if (previous !
1381 _FindBestDriver(const char* path, driver_module_info*& bestDriver, float& bestSupport, device_node* previous) argument
1581 device_node* previous = NULL; local
[all...] |
| /haiku/src/tests/system/kernel/slab/ |
| H A D | Slab.cpp | 235 fStores[i].loaded = fStores[i].previous = NULL;
268 // if it's not empty, or from the previous magazine if it's full
278 if (store->previous && (_IsMagazineFull(store->previous)
279 || _ExchangeWithFull(store->previous)))
280 std::swap(store->previous, store->loaded);
293 // and it's not full, or to the previous one if it is empty. If
301 if ((store->previous && _IsMagazineEmpty(store->previous))
302 || _ExchangeWithEmpty(store->previous))
[all...] |
| H A D | Slab.h | 488 Magazine *loaded, *previous; member in struct:BaseDepot::CPUStore
|