Searched refs:next (Results 26 - 50 of 546) sorted by relevance

1234567891011>>

/haiku/src/add-ons/kernel/file_systems/nfs4/
H A DRootInode.cpp85 uint32 count, next = 0; local
90 if (count >= next && values[next].fAttribute == FATTR4_FILES_FREE) {
91 fInfoCache.free_nodes = values[next].fData.fValue64;
92 next++;
95 if (count >= next && values[next].fAttribute == FATTR4_FILES_TOTAL) {
96 fInfoCache.total_nodes = values[next].fData.fValue64;
97 next++;
101 if (count >= next
[all...]
/haiku/headers/private/kernel/util/
H A DSinglyLinkedList.h20 SinglyLinkedListLink() : next(NULL) {}
23 Element* next; member in class:SinglyLinkedListLink
184 sGetLink(element)->next = fFirst;
204 Element* next = fFirst;
206 while (element != next) {
207 if (next == NULL)
209 last = next;
210 next = sGetLink(next)->next;
[all...]
H A DDoublyLinkedQueue.h184 elLink->next = fFirst;
206 link->next = before;
209 sGetLink(link->previous)->next = element;
239 fFirst = elLink->next;
241 sGetLink(elLink->previous)->next = elLink->next;
243 if (elLink->next)
244 sGetLink(elLink->next)->previous = elLink->previous;
246 elLink->next = elLink->previous = NULL;
259 Element *aNext = aLink->next;
[all...]
/haiku/src/add-ons/kernel/drivers/input/hid_shared/
H A DDeviceList.cpp15 device_list_entry * next; member in struct:device_list_entry
33 device_list_entry *next = current->next; local
36 current = next;
55 entry->next = NULL;
62 if (current->next == NULL) {
63 current->next = entry;
67 current = current->next;
88 fDeviceList = current->next;
90 previous->next
[all...]
/haiku/src/system/libroot/posix/malloc_hoard2/
H A Darch-specific.cpp42 free_chunk *next; member in struct:free_chunk
90 // This will locate the heap base at 384 MB and reserve the next 1152 MB
128 for (; chunk != NULL; chunk = chunk->next) {
136 newChunk->next = smaller->next;
137 smaller->next = newChunk;
139 newChunk->next = sFreeChunks;
165 for (; chunk != NULL; chunk = chunk->next) {
183 free_chunk *next = chunk->next; local
[all...]
/haiku/src/libs/alm/
H A DTab.cpp20 next(_next),
27 delete next;
34 return next ? next->HasLayout(search) : false;
40 BALMLayoutList* _next = next;
44 if (next)
45 next = next->Remove(remove);
49 BALMLayoutList* next; member in struct:TabBase::BALMLayoutList
129 layouts = layouts->next;
[all...]
/haiku/src/servers/app/
H A DWindowList.cpp19 next(NULL),
63 windowAnchor.next = before;
66 windowAnchor.previous->Anchor(fIndex).next = window;
74 fLastWindow->Anchor(fIndex).next = window;
81 windowAnchor.next = NULL;
97 fFirstWindow = windowAnchor.next;
100 windowAnchor.previous->Anchor(fIndex).next = windowAnchor.next;
107 // then it must have a next sibling
108 windowAnchor.next
[all...]
/haiku/src/add-ons/kernel/drivers/network/ether/pegasus/
H A Ddevlist.c36 device->next = sDeviceList;
52 sDeviceList = device->next;
57 for (previous = sDeviceList; previous != NULL; previous = previous->next) {
58 if (previous->next == device) {
59 previous->next = device->next;
77 for (device = sDeviceList; device != NULL; device = device->next) {
121 for (i = 0, device = sDeviceList; device != NULL; device = device->next) {
/haiku/src/add-ons/kernel/network/ppp/ppp_frame/
H A Dppp_frame.cpp93 TRACE("%s: next module is %s\n", __func__, protocol->next->module->info.name);
94 return protocol->next->module->send_data(protocol->next, buffer);
103 return protocol->next->module->interface_up(protocol->next);
111 protocol->next->module->interface_down(protocol->next);
122 return protocol->next->module->change_address(protocol->next, addres
[all...]
/haiku/src/add-ons/kernel/file_systems/ntfs/libntfs/
H A Dcache.c76 cache->free_hash = link->next;
79 link->next = first;
81 link->next = NULL;
116 link = link->next;
120 previous->next = link->next;
122 cache->first_hash[hash] = link->next;
123 link->next = cache->free_hash;
165 link = link->next;
177 current = current->next;
379 struct CACHED_GENERIC *next; local
[all...]
/haiku/src/system/kernel/util/
H A Dlist.cpp27 list->link.next = list->link.prev = &list->link;
47 link->next = list->link.next;
50 list->link.next->prev = link;
51 list->link.next = link;
54 ASSERT(link->next != link);
67 link->next = &list->link;
70 list->link.prev->next = link;
88 link->next->prev = link->prev;
89 link->prev->next
[all...]
H A Dqueue.cpp14 void *next; member in struct:queue_element
44 last->next = temp->next;
46 q->head = (queue_element*)temp->next;
54 temp = (queue_element*)temp->next;
71 q->tail->next = elem;
74 elem->next = NULL;
88 q->head = (queue_element*)q->head->next;
/haiku/src/add-ons/kernel/network/datalink_protocols/loopback_frame/
H A Dloopback_frame.cpp110 return protocol->next->module->send_data(protocol->next, buffer);
117 return protocol->next->module->interface_up(protocol->next);
124 return protocol->next->module->interface_down(protocol->next);
133 return protocol->next->module->change_address(protocol->next, address,
142 return protocol->next->module->control(protocol->next, optio
[all...]
/haiku/src/kits/support/
H A DBlockCache.cpp36 _FreeBlock *next; member in struct:BBlockCache::_FreeBlock
85 block->next = fFreeList;
88 DEBUG_ONLY(block->magic2 = MAGIC2 + (uint32)(addr_t)block->next);
99 ASSERT(fFreeList->magic2 == MAGIC2 + (uint32)(addr_t)fFreeList->next);
101 fFreeList = fFreeList->next;
118 ASSERT(fFreeList->magic2 == MAGIC2 + (uint32)(addr_t)fFreeList->next);
120 fFreeList = fFreeList->next;
142 block->next = fFreeList;
146 DEBUG_ONLY(block->magic2 = MAGIC2 + (uint32)(addr_t)block->next);
/haiku/headers/private/kernel/boot/net/
H A DChainBuffer.h14 ChainBuffer(void *data = 0, uint32 size = 0, ChainBuffer *next = NULL,
25 void Append(ChainBuffer *next);
38 void _Init(void *data, uint32 size, ChainBuffer *next, uint32 flags);
/haiku/src/kits/package/hpkg/
H A DStrings.cpp46 CachedString* next = cachedString->next; local
48 cachedString = next;
/haiku/src/kits/media/
H A DTimedEventQueuePrivate.cpp63 entry = entry->next;
88 fFirstEntry->next = NULL;
98 newentry->next = fFirstEntry;
110 newentry->next = NULL;
111 fLastEntry->next = newentry;
124 newentry->next = entry->next;
125 (entry->next)->prev = newentry;
126 entry->next = newentry;
142 for (event_queue_entry *entry = fFirstEntry; entry; entry = entry->next) {
[all...]
/haiku/src/bin/bfs_tools/lib/
H A DCache.h24 next(NULL),
37 Cacheable *prev,*next; member in class:Cache::Cacheable
66 if (entry->next)
67 entry->next->prev = prev;
69 prev->next = entry->next;
133 entry->prev->next = entry->next;
134 if (!entry->next)
142 entry->next
[all...]
/haiku/src/system/libroot/os/arch/x86_64/
H A Dtls.cpp40 auto next = gNextSlot++; local
41 if (next < TLS_MAX_KEYS)
42 return next;
/haiku/src/system/libroot/os/arch/x86/
H A Dtls.c33 int32 next = atomic_add(&gNextSlot, 1); local
34 if (next >= TLS_MAX_KEYS)
37 return next;
/haiku/src/system/libroot/os/arch/arm64/
H A Dtls.c35 int32 next = atomic_add(&gNextSlot, 1); local
36 if (next >= TLS_MAX_KEYS)
39 return next;
/haiku/src/system/kernel/
H A Dtimer.cpp74 timer* next; local
78 for (next = *list; next; last = next, next = (timer*)next->next) {
79 if ((bigtime_t)next->schedule_time >= (bigtime_t)event->schedule_time)
84 event->next = last->next;
[all...]
/haiku/headers/private/fs_shell/
H A DSinglyLinkedList.h23 SinglyLinkedListLink() : next(NULL) {}
26 Element* next; member in class:FSShell::SinglyLinkedListLink
183 sGetLink(element)->next = fFirst;
196 Element* next = fFirst;
198 while (next != NULL && element != next) {
199 last = next;
200 next = sGetLink(next)->next;
[all...]
/haiku/headers/os/drivers/pcmcia/
H A Dcs_timer.h35 struct timer_list *next, *prev; member in struct:timer_list
/haiku/src/add-ons/print/drivers/postscript/
H A DPPDParser.cpp66 int32 pos = 0, next; local
71 while ((next = fContent.FindFirst('\n', pos)) > 0) {
73 fContent.CopyInto(line, pos, next - pos);
86 pos = next +1;

Completed in 311 milliseconds

1234567891011>>