/haiku/src/system/kernel/cache/ |
H A D | file_cache.cpp | 239 // the iovec can be combined with the previous one 269 int32 previous = index - 1; local 270 if (previous < 0) 271 previous = LAST_ACCESSES - 1; 273 if (offset != ref->LastAccess(previous, isWrite)) 274 ref->last_access[previous] = 0; 301 int32 previous = index - 1; local 302 if (previous < 0) 303 previous = LAST_ACCESSES - 1; 306 ref->LastAccessPageOffset(previous, tru [all...] |
/haiku/src/system/kernel/debug/ |
H A D | debug.cpp | 888 // Index of the previous command line, if the command returned 910 // the previous command can be repeated 1404 // Allocate memory for the previous session's debug syslog output. In 1453 dprintf("Failed to open previous syslog file: %s\n", strerror(errno)); 2235 Thread* previous = sDebuggedThread; local 2237 return previous;
|
/haiku/src/system/kernel/device_manager/ |
H A D | IORequest.cpp | 1169 IORequest::NextSubRequest(IORequest* previous) argument 1171 if (previous == NULL) 1173 return dynamic_cast<IORequest*>(fChildren.GetNext(previous));
|
H A D | IORequest.h | 295 IORequest* NextSubRequest(IORequest* previous);
|
H A D | device_manager.cpp | 175 device_node* previous = NULL); 177 status_t _RegisterDynamic(device_node* previous = NULL); 1826 float& bestSupport, device_node* previous) 1829 bestSupport = previous != NULL ? previous->fSupportsParent : 0.0f; 1834 if (previous != NULL && driver == previous->DriverModule()) { 1903 device_node::_RegisterDynamic(device_node* previous) argument 1924 _FindBestDriver(path.Path(), bestDriver, bestSupport, previous); 1937 if (previous ! 1825 _FindBestDriver(const char* path, driver_module_info*& bestDriver, float& bestSupport, device_node* previous) argument 2003 device_node* previous = NULL; local [all...] |
/haiku/src/system/kernel/fs/ |
H A D | fd.cpp | 162 int32 previous = atomic_add(&descriptor->ref_count, -1); local 170 if (previous == 1) { 177 && previous - 1 == descriptor->open_count
|
/haiku/src/system/kernel/ |
H A D | heap.cpp | 1132 heap_area *previous = heap->all_areas; local 1133 while (previous) { 1134 if (previous->all_next == area) { 1135 previous->all_next = area->all_next; 1139 previous = previous->all_next; 1142 if (previous == NULL)
|
H A D | smp.cpp | 601 uint32 previous = atomic_get_and_set(&lock->lock, 0); local 602 if ((previous & 1u << 31) == 0) { 604 "%#" B_PRIx32 ")\n", lock, previous); 627 uint32 previous = atomic_add(&lock->lock, 1); local 628 return (previous & (1u << 31)) == 0; 666 uint32 previous = atomic_add(&lock->lock, -1); local 667 if ((previous & 1u << 31) != 0) { 669 " %#" B_PRIx32 ")\n", lock, previous);
|
H A D | syscalls.cpp | 71 generic_syscall* previous; member in struct:generic_syscall 175 syscall = syscall->previous; 254 generic_syscall* previous = find_generic_syscall(subsystem); local 255 if (previous != NULL) { 257 || version < previous->version) { 260 if ((previous->flags & B_SYSCALL_NOT_REPLACEABLE) != 0) 274 syscall->previous = previous; 279 if (previous != NULL) 280 sGenericSyscalls.Remove(previous); [all...] |
H A D | usergroup.cpp | 239 BReference<BKernel::GroupsArray> previous = team->supplementary_groups; local
|
/haiku/src/system/kernel/locks/ |
H A D | lock.cpp | 628 rw_lock_waiter* previous = NULL; local 631 previous = other; 635 if (previous == NULL) { 642 previous->next = waiter.next; 644 lock->waiters->last = previous;
|
/haiku/src/system/kernel/util/ |
H A D | AVLTreeBase.cpp | 96 // The previous node cannot be in the right subtree. 105 AVLTreeNode* previous; local 107 previous = node; 109 } while (node && previous == node->left); 130 AVLTreeNode* previous; local 132 previous = node; 134 } while (node && previous == node->right);
|
/haiku/src/system/kernel/vm/ |
H A D | vm_page.cpp | 960 page->queue_link.previous);
|
/haiku/src/system/libnetwork/ |
H A D | getifaddrs.cpp | 54 _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/system/libroot/posix/malloc_debug/ |
H A D | heap.cpp | 762 heap_area *previous = heap->all_areas; local 763 while (previous) { 764 if (previous->all_next == area) { 765 previous->all_next = area->all_next; 769 previous = previous->all_next; 772 if (previous == NULL)
|
/haiku/src/system/libroot/posix/malloc_hoard2/ |
H A D | wrapper.cpp | 153 struct stack_frame* previous; member in struct:stack_frame 162 frame = frame->previous;
|
/haiku/src/tools/fs_shell/ |
H A D | block_cache.cpp | 773 sure that the previous block contents are preserved in that case. 857 // remember any previous contents for the parent transaction 892 cache_transaction* previous = block->previous_transaction; local 895 void* data = previous && block->original_data 897 // we first need to write back changes from previous transactions 913 if (previous != NULL) { 914 previous->blocks.Remove(block); 924 // Has the previous transation been finished with that write? 925 if (--previous->num_blocks == 0) { 926 TRACE(("cache transaction %ld finished!\n", previous [all...] |
H A D | fd.cpp | 139 int32_t previous = fssh_atomic_add(&descriptor->ref_count, -1); local 145 if (previous == 1) { 152 && previous - 1 == descriptor->open_count
|
/haiku/src/tools/gensyscalls/ |
H A D | gensyscalls.cpp | 166 if (Parameter* previous = LastParameter()) 167 offset = previous->Offset() + previous->UsedSize();
|