/haiku/src/add-ons/kernel/file_systems/ntfs/libntfs/ |
H A D | security.h | 74 struct CACHED_PERMISSIONS_LEGACY *previous; member in struct:CACHED_PERMISSIONS_LEGACY 89 struct CACHED_SECURID *previous; member in struct:CACHED_SECURID
|
/haiku/src/system/libroot/os/ |
H A D | debug.c | 198 bool previous = _rtDebugFlag; local 200 return previous;
|
/haiku/src/system/kernel/debug/ |
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;
|
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/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/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/add-ons/kernel/bluetooth/hci/ |
H A D | bluetooth.cpp | 288 || device->GetDoublyLinkedListLink()->previous != NULL
|
/haiku/src/add-ons/kernel/file_systems/nfs4/ |
H A D | DirectoryCache.cpp | 168 NameCacheEntry* previous = NULL; local 172 fNameCache.Remove(previous, current); 177 previous = current; 184 previous = NULL; 188 fDirectoryCache->fEntries.Remove(previous, current); 193 previous = current;
|
H A D | Cookie.cpp | 113 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);
|
H A D | RPCServer.cpp | 446 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 D | FileInfo.cpp | 73 InodeName* previous = NULL; local 77 fNames.Remove(previous, current); 82 previous = current;
|
/haiku/headers/private/kernel/util/ |
H A D | SplayTree.h | 503 if (Node* previous = fTree.PreviousDontSplay(Definition::GetKey(node))) 504 previousNext = Definition::GetListLink(previous); 521 if (Node* previous = fTree.PreviousDontSplay(key)) 522 previousNext = Definition::GetListLink(previous); 537 if (Node* previous = fTree.PreviousDontSplay(Definition::GetKey(node))) 538 previousNext = Definition::GetListLink(previous);
|
H A D | SinglyLinkedList.h | 149 inline void Remove(Element* previous, Element* element); 226 SINGLY_LINKED_LIST_CLASS_NAME::Remove(Element* previous, Element* element) argument 228 // ASSERT(previous == NULL 229 // ? fFirst == element : sGetLink(previous)->next == element); 232 if (previous == NULL) 235 sGetLink(previous)->next = elementLink->next;
|
/haiku/src/kits/game/ |
H A D | GameProducer.cpp | 37 _gs_play* previous; member in struct:_gs_play
|
/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/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/apps/haikudepot/edits_generic/ |
H A D | UndoableEdit.h | 27 virtual bool UndoesPrevious(const UndoableEdit* previous); 30 const UndoableEdit* previous);
|
/haiku/src/add-ons/kernel/file_systems/userlandfs/private/ |
H A D | RequestPort.cpp | 17 AllocatorNode(Port* port) : allocator(port), previous(NULL) {} 20 AllocatorNode* previous; member in struct:RequestPort::AllocatorNode 146 node->previous = fCurrentAllocatorNode; 204 AllocatorNode* node = fCurrentAllocatorNode->previous;
|
/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/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/preferences/screensaver/ |
H A D | ScreenCornerSelector.h | 45 screen_corner previous) const;
|
/haiku/src/add-ons/kernel/file_systems/netfs/server/ |
H A D | AttributeDirectory.cpp | 267 Attribute* previous = NULL; local 276 previous = attribute; 286 fAttributes.InsertAfter(previous, attribute);
|
/haiku/src/system/libroot/posix/glibc/include/arch/ppc/ |
H A D | sysdep.h | 125 .previous; \ 137 .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/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...] |