Searched refs:next (Results 151 - 175 of 546) sorted by relevance

1234567891011>>

/haiku/src/add-ons/kernel/file_systems/packagefs/nodes/
H A DDirectory.cpp26 Node* next = child->NameHashTableNext(); local
28 child = next;
/haiku/src/servers/package/
H A DVolumeState.cpp30 Package* next = package->NodeRefHashTableNext(); local
32 package = next;
/haiku/src/add-ons/accelerants/radeon/
H A Doverlay_management.c155 node->next = vc->overlay_buffers;
157 if( node->next )
158 node->next->prev = node;
207 if( node->next )
208 node->next->prev = node->prev;
211 node->prev->next = node->next;
213 vc->overlay_buffers = node->next;
H A DCP.c109 tmp_oldest_buffer = oldest_buffer->next;
115 oldest_buffer->next = cp->buffers.free_list;
182 cp->buffers.free_list = cp->buffers.buffers[buffer_idx].next;
215 cp->buffers.buffers[buffer_idx].next = cp->buffers.free_list;
322 cp->buffers.buffers[cp->buffers.newest].next = buffer_idx;
327 cp->buffers.buffers[buffer_idx].next = -1;
/haiku/src/add-ons/kernel/drivers/audio/ac97/es1370/
H A Des1370.h41 LIST_ENTRY(_es1370_mem) next; member in struct:_es1370_mem
64 LIST_ENTRY(_es1370_stream) next; member in struct:_es1370_stream
/haiku/src/system/boot/platform/bios_ia32/
H A Dlong.cpp247 fix_address(image->next);
276 // Iterate over the preloaded images. Must save the next address before
277 // converting, as the next pointer will be converted.
281 preloaded_image* next = image->next; local
283 image = next;
300 driver_settings_file* next = file->next; local
301 fix_address(file->next);
303 file = next;
[all...]
/haiku/src/add-ons/kernel/file_systems/websearchfs/
H A Dwebsearchfs.h65 struct fs_node *next; /* next in folder */ member in struct:fs_node
103 struct fs_file_cookie *next; /* must stay here */ member in struct:fs_file_cookie
/haiku/src/add-ons/kernel/bus_managers/virtio/
H A DVirtioQueue.cpp104 fIndirect[i].next = i + 1;
105 fIndirect[indirectMaxSize - 1].next = UINT16_MAX;
169 fRing.desc[i].next = i + 1;
170 fRing.desc[fRingSize - 1].next = UINT16_MAX;
279 index = fRing.desc[index].next;
287 fRing.desc[index].next = fRingHeadIndex;
349 fRingHeadIndex = fRing.desc[insertIndex].next;
378 for (size_t i = 0; i < total; i++, index = desc[index].next) {
/haiku/src/system/kernel/slab/
H A DMemoryManager.h78 Chunk* next; member in union:MemoryManager::Chunk::__anon1941
101 Area* next; member in struct:MemoryManager::Area
137 return value->next;
294 return chunk->next == NULL
295 || (chunk->next >= metaChunk->chunks
296 && chunk->next < metaChunk->chunks + metaChunk->chunkCount);
/haiku/src/add-ons/kernel/network/datalink_protocols/arp/
H A Darp.cpp68 arp_entry *next; member in struct:arp_entry
148 return value->next;
349 protocol->next->module->send_data(protocol->next, buffer);
612 return entry->protocol->next->module->send_data(entry->protocol->next,
751 status_t status = entry->protocol->next->module->send_data(
752 entry->protocol->next, request);
1066 return protocol->next->module->send_data(protocol->next, buffe
[all...]
/haiku/src/kits/storage/
H A DResourceStrings.cpp256 fHashTable[i] = entry->next;
285 fHashTable[i] = entry->next;
287 entry->next = newHashTable[newPos];
322 entry->next = fHashTable[pos];
341 entry = entry->next;
362 : next(NULL),
/haiku/src/system/libroot/os/
H A Dthread.c25 struct callback_node *next; member in struct:callback_node
64 callback_node *next; local
67 next = node->next;
72 node = next;
206 node->next = *head;
/haiku/src/system/libnetwork/netresolv/isc/
H A Deventlib_p.h88 struct evConn * next; member in struct:evConn
121 struct evFile * next; member in struct:evFile
142 struct evStream *prev, *next; member in struct:evStream
158 struct evWait * next; member in struct:evWait
165 struct evWaitList * next; member in struct:evWaitList
176 struct { struct evEvent_p *next; } free; member in struct:evEvent_p::__anon19::__anon25
H A Dev_streams.c88 new->next = ctx->streams;
122 new->next = ctx->streams;
170 old->prev->next = old->next;
172 ctx->streams = old->next;
173 if (old->next != NULL)
174 old->next->prev = old->prev;
/haiku/src/system/kernel/arch/x86/paging/
H A Dx86_physical_page_mapper_large_memory.cpp204 fSlots = slot->next;
212 slot->next = fSlots;
244 fSlots = slot->next;
257 while (fSlots == NULL || fSlots->next == NULL) {
266 slot2 = slot1->next;
267 fSlots = slot2->next;
276 slot->next = fSlots;
279 if (slot->next == NULL)
281 else if (slot->next->next
[all...]
/haiku/src/system/kernel/arch/m68k/paging/
H A Dm68k_physical_page_mapper_large_memory.cpp211 fSlots = slot->next;
219 slot->next = fSlots;
251 fSlots = slot->next;
264 while (fSlots == NULL || fSlots->next == NULL) {
273 slot2 = slot1->next;
274 fSlots = slot2->next;
283 slot->next = fSlots;
286 if (slot->next == NULL)
288 else if (slot->next->next
[all...]
/haiku/src/system/kernel/arch/arm/paging/
H A Darm_physical_page_mapper_large_memory.cpp206 fSlots = slot->next;
214 slot->next = fSlots;
246 fSlots = slot->next;
259 while (fSlots == NULL || fSlots->next == NULL) {
268 slot2 = slot1->next;
269 fSlots = slot2->next;
278 slot->next = fSlots;
281 if (slot->next == NULL)
283 else if (slot->next->next
[all...]
/haiku/src/system/kernel/
H A Dint.cpp42 struct io_handler *next; member in struct:io_handler
104 for (io = sVectors[i].handler_list; io != NULL; io = io->next) {
304 for (io = sVectors[vector].handler_list; io != NULL; io = io->next) {
330 while (last && last->next)
331 last = last->next;
340 || sVectors[vector].handler_list->next == NULL) {
489 while (last->next)
490 last = last->next;
492 io->next = NULL;
493 last->next
[all...]
H A Dsmp.cpp72 struct smp_msg *next; member in struct:smp_msg
231 message = message->next;
245 message = message->next;
270 kprintf(" next: %p\n", message->next);
754 sFreeMessages = (*msg)->next;
783 sFreeMessages = (*_message)->next;
799 msg->next = sFreeMessages;
819 msg->next, msg) != msg);
833 msg = msg->next;
1078 struct smp_msg* next; local
[all...]
/haiku/src/add-ons/kernel/file_cache/
H A Dlaunch_speedup.cpp58 struct node *next; member in struct:node
87 return value->next;
429 struct node *node, *next = NULL; local
439 for (; node != NULL; node = next) {
440 next = node->next;
527 for (struct node *node = fNodes; node != NULL; node = node->next) {
573 node->next = fNodes;
817 Session *next = session->next; local
823 Session *next = session->next; local
[all...]
/haiku/src/add-ons/kernel/network/ppp/pap/
H A DProtocol.cpp263 PAP::NewState(pap_state next) argument
265 TRACE("PAP: NewState(%d) state=%d\n", next, State());
268 if (State() == INITIAL && next != State()) {
275 } else if (State() == ACCEPTED && next != State())
279 if (next == INITIAL || next == ACCEPTED)
282 fState = next;
/haiku/src/kits/tracker/
H A DRegExp.cpp107 // plus a "next" pointer, possibly plus an operand. "Next" pointers of
108 // all nodes except kRegExpBranch implement concatenation; a "next" pointer
128 kRegExpBranch = 6, // node Match this alternative, or the next...
129 kRegExpBack = 7, // no Match "", "next" ptr points backward.
143 // hooked together with their "next" pointers, since precedence prevents
145 // "next" pointer of the last kRegExpBranch in a choice points to the
147 // final "next" pointer of each individual branch points; each
150 // kRegExpBack Normal "next" pointers all implicitly point forward;
162 // A node is one char of opcode followed by two chars of "next" pointer.
168 // Using two bytes for the "next" pointe
579 char* next; local
1024 const char* next; // Next node. local
1363 const char* next; local
[all...]
/haiku/src/system/libroot/posix/malloc_debug/
H A Dguarded_heap.cpp86 list_link* next; member in struct:list_link
101 link->next->prev = link->prev;
102 link->prev->next = link->next;
111 link->next = &list->link;
114 list->link.prev->next = link;
123 if (list->link.next == (list_link *)list)
126 return GET_ITEM(list, list->link.next);
130 if (link->next == &list->link)
133 return GET_ITEM(list, link->next);
176 guarded_heap_area* next; member in struct:guarded_heap_area
[all...]
/haiku/src/add-ons/kernel/network/datalink_protocols/ipv6_datagram/
H A Dipv6_datagram.cpp98 ndp_entry* next; member in struct:ndp_entry
148 return value->next;
378 protocol->next->module->send_data(protocol->next, buffer);
403 sIPv6Protocol->next = NULL;
1062 return protocol->next->module->send_data(protocol->next, buffer);
1071 status_t status = protocol->next->module->interface_up(protocol->next);
1079 protocol->next
[all...]
/haiku/src/add-ons/kernel/drivers/network/wlan/realtekwifi/dev/rtwn/usb/
H A Drtwn_usb_rx.c218 /* Align next frame. */
282 /* Align next frame. */
370 struct mbuf *m = NULL, *next; local
380 STAILQ_REMOVE_HEAD(&uc->uc_rx_active, next);
382 STAILQ_INSERT_TAIL(&uc->uc_rx_inactive, data, next);
391 STAILQ_REMOVE_HEAD(&uc->uc_rx_inactive, next);
392 STAILQ_INSERT_TAIL(&uc->uc_rx_active, data, next);
403 next = m->m_nextpkt;
417 m = next;
424 STAILQ_REMOVE_HEAD(&uc->uc_rx_active, next);
[all...]

Completed in 167 milliseconds

1234567891011>>