Searched refs:next (Results 326 - 350 of 546) sorted by relevance

<<11121314151617181920>>

/haiku/src/add-ons/kernel/busses/usb/
H A Dehci_hardware.h140 struct ehci_itd *next; member in struct:ehci_itd
192 struct ehci_sitd *next; member in struct:ehci_sitd
/haiku/headers/private/shared/
H A DHashSet.h306 Element* next = element->fNext; local
308 element = next;
/haiku/src/bin/bfs_tools/lib/
H A DBPlusTree.cpp393 // if the node is out of duplicates, we go directly to the next one
564 status_t BPlusTree::FindKey(bplustree_node *node,uint8 *key,uint16 keyLength,uint16 *index,off_t *next) argument
570 if (next)
571 *next = node->overflow_link;
600 if (next)
601 *next = values[i];
608 if (next)
611 *next = node->overflow_link;
613 *next = values[saveIndex];
820 // of the next nod
[all...]
/haiku/src/kits/locale/
H A DTimeFormat.cpp134 while (positionIterator.next(field)) {
175 while (positionIterator.next(field)) {
/haiku/src/add-ons/kernel/drivers/input/i2c_hid/
H A DHIDDevice.cpp126 ProtocolHandler *next = handler->NextHandler(); local
128 handler = next;
/haiku/src/system/kernel/fs/
H A DEntryCache.cpp67 EntryCacheEntry* next = entry->hash_link; local
69 entry = next;
H A Dfd.cpp235 possible (in one of the next calls to put_fd() - get_fd() will no longer
530 select_info* next = info->next; local
532 info = next;
593 info->next = NULL;
603 info->next = context->select_infos[fd];
639 infoLocation = &(*infoLocation)->next;
645 *infoLocation = info->next;
/haiku/src/add-ons/kernel/partitioning_systems/common/
H A DPartitionMap.h112 We can also retrieve the name of that partition type or find the next
266 void SetNext(LogicalPartition* next) argument
267 { fNext = next; }
H A DPartitionMap.cpp315 /*! \brief Finds next supported partition.
607 LogicalPartition* next = partition->Next(); local
610 prev->SetNext(next);
612 fHead = next;
613 if (next)
614 next->SetPrevious(prev);
660 // data and are only used to point to the next partition table in the
/haiku/src/add-ons/kernel/drivers/input/usb_hid/
H A DHIDDevice.cpp222 ProtocolHandler *next = handler->NextHandler(); local
224 handler = next;
/haiku/src/add-ons/kernel/network/stack/
H A Droutes.cpp342 uint8* next = (uint8*)buffer + size; local
345 destination = (sockaddr*)next;
346 next += route->destination->sa_len;
350 mask = (sockaddr*)next;
351 next += route->mask->sa_len;
355 gateway = (sockaddr*)next;
356 next += route->gateway->sa_len;
385 buffer = (void*)next;
/haiku/src/system/kernel/arch/ppc/
H A Darch_debug.cpp65 get_next_frame(addr_t framePointer, addr_t *next, addr_t *ip) argument
74 *next = (addr_t)frame.previous;
/haiku/src/system/kernel/arch/m68k/
H A Darch_debug.cpp66 get_next_frame(addr_t framePointer, addr_t *next, addr_t *ip) argument
75 *next = (addr_t)frame.previous;
/haiku/src/system/kernel/
H A Dsem.cpp112 struct sem_entry* next; member in struct:sem_entry::__anon1::__anon3
216 kprintf("next: %p\n", sem->u.unused.next);
281 // set next_id to the next possible value; for sanity check the current ID
288 sFreeSemsTail->u.unused.next = sem;
292 sem->u.unused.next = NULL;
503 sFreeSemsHead = sem->u.unused.next;
560 info->next = sSems[slot].u.used.select_infos;
588 infoLocation = &(*infoLocation)->next;
591 *infoLocation = info->next;
[all...]
/haiku/src/add-ons/kernel/bluetooth/btCoreData/
H A DConnectionInterface.cpp120 if (conn->GetDoublyLinkedListLink()->next != NULL
149 if (conn->GetDoublyLinkedListLink()->next != NULL
/haiku/src/add-ons/kernel/file_systems/packagefs/volume/
H A DVolume.cpp200 Index* next = index->IndexHashLink(); local
202 index = next;
208 Node* next = node->IDHashTableNext(); local
210 node = next;
589 if (NodeListener* next = listener->RemoveNodeListener()) {
595 fNodeListeners.Insert(next);
966 Package* next = package->FileNameHashTableNext(); local
968 package = next;
1085 // continue with the next available (ancestors's) sibling
1150 // continue with the next availabl
1934 NodeListener* next = listener->NextNodeListener(); local
1960 NodeListener* next = listener->NextNodeListener(); local
1987 NodeListener* next = listener->NextNodeListener(); local
[all...]
/haiku/src/add-ons/kernel/file_systems/ntfs/libntfs/
H A Ddevice.c707 for (hd = devlist; hd; hd = hd->next) {
715 names = names->next) {
727 for (hd = partlist; hd; hd = hd->next) {
735 names = names->next) {
757 for (res = hd->res; res; res = res->next) {
/haiku/src/libs/glut/
H A Dglutint.h321 GLUTcolormap *next; /* next colormap in list */ member in struct:_GLUTcolormap
470 GLUTstale *next; member in struct:_GLUTstale
535 GLUTmenuItem *next; /* next menu entry on list for menu */ member in struct:_GLUTmenuItem
540 GLUTtimer *next; /* list of timers */ member in struct:_GLUTtimer
552 GLUTeventParser *next; member in struct:_GLUTeventParser
/haiku/src/add-ons/kernel/file_systems/layers/write_overlay/
H A Dwrite_overlay.cpp86 write_buffer * next; member in struct:write_overlay::write_buffer
299 write_buffer *next = element->next; local
301 element = next;
706 // next position, fill the gap with original file content
753 // there's a gap before our next position which we cannot
787 element = element->next;
821 link = &other->next;
822 other = other->next;
862 other = other->next;
1212 write_buffer *next = buffer->next; local
[all...]
/haiku/src/system/kernel/cache/
H A Dblock_cache.cpp66 cached_block* next; // next in hash member in struct:__anon39::cached_block
109 // be written back before that transaction becomes the next previous
188 return value->next;
268 cache_transaction* next; member in struct:__anon39::cache_transaction
1055 return value->next;
2180 kprintf(" next in transaction: %" B_PRIdOFF "\n",
2532 unlocked with the next call to this function. Ignores caches that are in
2594 const bigtime_t next = cache->last_block_write local
2596 if (cache->busy_writing_count > 16 || system_time() < next) {
2910 cached_block* next; local
2965 cached_block* next; local
3037 cached_block* next; local
3124 cached_block* next; local
3206 cached_block* next; local
3429 cached_block* next = block->next; local
3438 cache_transaction* next = transaction->next; local
[all...]
/haiku/src/system/boot/loader/net/
H A DTCP.cpp61 static unsigned int next = 0; local
62 if (next == 0)
63 next = real_time_clock_usecs() / 1000000;
65 next = (next >> 1) ^ (unsigned int)((0 - (next & 1U)) & 0xd0000001U);
67 return next;
478 TRACE_QUEUE("TCP: Enqueuing %lx - %lx in front! (next is %lx)\n",
/haiku/src/add-ons/kernel/network/ppp/ipcp/
H A DProtocol.cpp656 IPCP::NewState(ppp_state next) argument
658 TRACE("IPCP: NewState(%d) state=%d\n", next, State());
661 if (State() == PPP_INITIAL_STATE && next != State())
663 else if (State() == PPP_OPENED_STATE && next != State())
667 if (next < PPP_CLOSING_STATE || next == PPP_OPENED_STATE)
670 fState = next;
1074 // this will be used in our next request
1090 // this will be used in our next request
1102 // this will be used in our next reques
[all...]
/haiku/src/add-ons/kernel/drivers/network/ether/pegasus/
H A Ddriver.c19 struct driver_cookie *next; member in struct:driver_cookie
464 cookie->next = device->open_fds;
703 device->open_fds = cookie->next;
706 for (p = device->open_fds; p != NULL; p = p->next) {
707 if (p->next == cookie) {
708 p->next = cookie->next;
/haiku/src/add-ons/kernel/drivers/disk/virtual/nbd/
H A Dnbd.c76 struct nbd_request_entry *next; member in struct:nbd_request_entry
95 uint64 req; /* next ID for requests */
199 r->next = NULL;
233 req->next = dev->reqs;
247 r = r->next;
253 prev->next = r->next;
255 dev->reqs = r->next;
824 nbd_devices[i].req = 0LL; /* next ID for requests */
/haiku/src/system/kernel/scheduler/
H A Dscheduling_analysis.cpp39 HashObject* next; member in struct:SchedulingAnalysis::HashObject
261 object->next = fHashTable[index];
270 slot = &(*slot)->next;
272 *slot = object->next;
280 object = object->next;
432 object = object->next;
462 object = object->next;

Completed in 592 milliseconds

<<11121314151617181920>>