/haiku/src/tools/fs_shell/ |
H A D | OpenHashTable.h | 227 ValueType* previous = NULL; local 234 if (previous) 235 _Link(previous) = next; 241 previous = slot;
|
/haiku/headers/posix/ |
H A D | pthread.h | 56 struct __pthread_cleanup_handler *previous; member in struct:__pthread_cleanup_handler
|
/haiku/headers/private/fs_shell/ |
H A D | DoublyLinkedList.h | 22 DoublyLinkedListLink() : next(NULL), previous(NULL) {} 26 Element *previous; member in class:FSShell::DoublyLinkedListLink 388 elLink->previous = fLast; 398 elLink->previous = NULL; 401 sGetLink(fFirst)->previous = element; 425 link->previous = beforeLink->previous; 426 if (link->previous != NULL) 427 sGetLink(link->previous)->next = element; 428 beforeLink->previous [all...] |
/haiku/headers/private/kernel/ |
H A D | smp.h | 236 uint32 previous = atomic_add(&lock->lock, 1); local 237 return (previous & (1u << 31)) == 0;
|
/haiku/headers/private/kernel/util/ |
H A D | DoublyLinkedList.h | 30 Element* previous; member in class:DoublyLinkedListLink 406 elLink->previous = fLast; 415 elLink->previous = NULL; 418 sGetLink(fFirst)->previous = element; 447 link->previous = beforeLink->previous; 448 beforeLink->previous = element; 450 if (link->previous != NULL) 451 sGetLink(link->previous)->next = element; 476 link->previous [all...] |
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; 241 sGetLink(elLink->previous)->next = elLink->next; 244 sGetLink(elLink->next)->previous = elLink->previous; [all...] |
H A D | OpenHashTable.h | 227 ValueType* previous = NULL; local 234 if (previous) 235 _Link(previous) = next; 241 previous = slot;
|
/haiku/src/add-ons/kernel/bluetooth/btCoreData/ |
H A D | ConnectionInterface.cpp | 121 || conn->GetDoublyLinkedListLink()->previous != NULL 150 || conn->GetDoublyLinkedListLink()->previous != NULL
|
/haiku/src/add-ons/kernel/busses/usb/ |
H A D | xhci.cpp | 1243 xhci_td *previous = NULL; local 1246 previous = td; 1251 if (previous == NULL) { 1254 previous->next = td->next;
|
/haiku/src/add-ons/kernel/drivers/input/hid_shared/ |
H A D | DeviceList.cpp | 82 device_list_entry *previous = NULL; 87 if (previous == NULL) 90 previous->next = current->next; 98 previous = current;
|
/haiku/src/add-ons/kernel/drivers/network/ether/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/src/add-ons/kernel/file_systems/bfs/ |
H A D | BPlusTree.cpp | 2477 // Test right link of the previous node 2478 const bplustree_node* previous = cached.SetTo(lastOffset, true); local 2479 if (previous == NULL) 2482 if (previous->RightLink() != childOffset) { 2485 "!\n", fStream->ID(), lastOffset, previous->RightLink(),
|
/haiku/src/add-ons/kernel/file_systems/ext2/ |
H A D | HTree.cpp | 194 uint32 previous = 0x37abe8f9; local 197 uint32 next = previous + (hash ^ (*name * 7152373)); 202 previous = hash;
|
/haiku/src/add-ons/kernel/file_systems/nfs/ |
H A D | nfs_add_on.c | 789 fs_node *previous; local 794 previous = NULL; 797 previous = current; 802 if (previous) 803 previous->next = current->next;
|
/haiku/src/add-ons/kernel/file_systems/ntfs/libntfs/ |
H A D | acls.c | 978 u16 previous; member in struct:__anon1 993 checks[i].previous = 0; 1021 if ((tag < pchk->previous) 1022 || ((tag == pchk->previous) 1025 pchk->previous = tag; 1144 u16 previous; local 1155 previous = pacl->ace[0].tag; 1161 if ((tag < previous) 1162 || ((tag == previous) && (id < previousid))) { 1168 previous [all...] |
/haiku/src/add-ons/kernel/file_systems/ntfs/ |
H A D | lowntfs.c | 806 of->previous = (struct open_file*)NULL; 808 ctx->open_files->previous = of; 1197 of->next->previous = of->previous; 1198 if (of->previous) 1199 of->previous->next = of->next;
|
/haiku/src/add-ons/kernel/network/devices/ethernet/ |
H A D | ethernet.cpp | 261 || device->GetDoublyLinkedListLink()->previous != NULL
|
/haiku/src/add-ons/kernel/network/ppp/ppp/ |
H A D | ppp.cpp | 161 || device->GetDoublyLinkedListLink()->previous != NULL
|
/haiku/src/add-ons/kernel/network/ppp/shared/libkernelppp/ |
H A D | KPPPInterface.cpp | 1020 KPPPProtocol *current = fFirstProtocol, *previous = NULL; 1026 previous = current; 1031 if (!previous) 1034 previous->SetNextProtocol(protocol); 1044 if (!previous) 1047 previous->SetNextProtocol(protocol); 1084 KPPPProtocol *current = fFirstProtocol, *previous = NULL; 1091 if (previous) { 1092 previous->SetNextProtocol(current->NextProtocol()); 1095 if (!previous [all...] |
/haiku/src/add-ons/kernel/network/protocols/ipv4/ |
H A D | ipv4.cpp | 282 net_buffer* previous = NULL; local 284 while ((previous = iterator.Next()) != NULL) { 285 if (previous->fragment.start <= start) { 290 next = previous; 295 if (previous != NULL && previous->fragment.start <= start 296 && previous->fragment.end >= end) { 305 TRACE(" previous: %p, next: %p", previous, next); 309 if (previous ! [all...] |
/haiku/src/add-ons/kernel/network/protocols/ipv6/ |
H A D | ipv6.cpp | 321 net_buffer* previous = NULL; local 323 while ((previous = iterator.Next()) != NULL) { 324 if (previous->fragment.start <= start) { 329 next = previous; 334 if (previous != NULL && previous->fragment.start <= start 335 && previous->fragment.end >= end) { 344 TRACE(" previous: %p, next: %p", previous, next); 348 if (previous ! [all...] |
/haiku/src/add-ons/kernel/network/protocols/tcp/ |
H A D | BufferQueue.cpp | 129 net_buffer *previous = NULL; local 131 while ((previous = iterator.Next()) != NULL) { 132 if (sequence >= previous->sequence) { 137 next = previous; 141 if (previous != NULL) { 142 if (sequence == previous->sequence) { 146 if (previous->size >= buffer->size) { 150 fList.Remove(previous); 151 fNumBytes -= previous->size; 152 gBufferModule->free(previous); [all...] |
/haiku/src/add-ons/kernel/network/stack/ |
H A D | net_buffer.cpp | 1597 data_node* previous = node; local 1601 list_insert_item_before(&buffer->buffers, previous, node);
|
/haiku/src/add-ons/kernel/partitioning_systems/common/ |
H A D | PartitionMap.h | 271 void SetPrevious(LogicalPartition* previous) argument 272 { fPrevious = previous; }
|
/haiku/src/add-ons/kernel/partitioning_systems/intel/ |
H A D | write_support.cpp | 199 according to childOffset returns previous and next sibling or NULL 205 partition_data* child, off_t childOffset, partition_data** previous, 225 *previous = previousSibling; 240 according to childOffset returns previous and next sibling or NULL 241 previous, next output parameters 246 partition_data* child, off_t childOffset, partition_data** previous, 266 *previous = previousSibling; 999 // putting into previous state 1235 // something went wrong - putting into previous state 1314 // something went wrong - putting into previous stat 204 get_sibling_partitions_pm(partition_data* partition, partition_data* child, off_t childOffset, partition_data** previous, partition_data** next, off_t* previousOffset, off_t* previousSize, off_t* nextOffset, off_t* nextSize) argument 245 get_sibling_partitions_ep(partition_data* partition, partition_data* child, off_t childOffset, partition_data** previous, partition_data** next, off_t* previousOffset, off_t* previousSize, off_t* nextOffset, off_t* nextSize) argument 2282 LogicalPartition* previous = logical->Previous(); local [all...] |