Searched refs:next (Results 1 - 25 of 559) sorted by relevance

1234567891011>>

/haiku/src/libs/libunwind/mi/
H A Ddyn-cancel.c36 di->prev->next = di->next;
38 _U_dyn_info_list.first = di->next;
40 if (di->next)
41 di->next->prev = di->prev;
45 di->next = di->prev = NULL;
H A Ddyn-register.c37 di->next = _U_dyn_info_list.first;
39 if (di->next)
40 di->next->prev = di;
/haiku/src/system/libroot/posix/glibc/misc/
H A Dinsremque.c27 struct qelem *next = ((struct qelem *) prev)->q_forw; local
29 if (next != NULL)
30 next->q_back = (struct qelem *) elem;
31 ((struct qelem *) elem)->q_forw = next;
40 struct qelem *next = ((struct qelem *) elem)->q_forw; local
42 if (next != NULL)
43 next->q_back = prev;
45 prev->q_forw = (struct qelem *) next;
/haiku/headers/private/kernel/util/
H A Dkqueue.h16 struct quehead *next; member in struct:quehead
22 for ((element) = (void *)(head)->next; (element) != (void *)(head); (element) = (void *)((struct quehead *)(element))->next)
32 head->next = head->prev = head;
44 element->next = head->next;
46 head->next = element;
47 element->next->prev = element;
58 element->next->prev = element->prev;
59 element->prev->next
[all...]
/haiku/src/system/boot/loader/net/
H A DChainBuffer.cpp14 ChainBuffer::ChainBuffer(void *data, uint32 size, ChainBuffer *next, argument
17 _Init(data, size, next,
34 ChainBuffer *next = fNext;
37 next->fFlags |= CHAIN_BUFFER_HEAD;
40 return next;
45 ChainBuffer::Append(ChainBuffer *next) argument
47 if (!next)
51 fNext->Append(next);
53 fNext = next;
75 ChainBuffer::_Init(void *data, uint32 size, ChainBuffer *next, uint3 argument
89 ChainBuffer *next = fNext; local
[all...]
/haiku/src/add-ons/input_server/filters/shortcut_catcher/
H A DCommandExecutor.cpp41 char* next = *setEnd; local
44 while (next++) {
45 if (*next == '\0')
47 else if (*next <= ' ')
48 *next = '\0';
53 *setBegin = next;
56 while (next++) {
57 if (*next <= ' ') {
58 *next = '\0'; // terminate the word
59 *setEnd = next;
[all...]
/haiku/src/system/kernel/platform/openfirmware/
H A Dopenfirmware_devices.cpp27 intptr_t next; local
44 next = node;
46 next = of_child(node);
48 if (next == OF_FAILED)
51 if (next == 0) {
53 next = of_peer(node);
54 if (next == OF_FAILED)
57 while (next == 0) {
61 next = of_parent(node);
62 if (next
[all...]
/haiku/src/add-ons/kernel/file_systems/googlefs/
H A Dlists.c11 item->next = NULL;
16 item->next = NULL;
27 p = p->next;
34 struct _slist_entry *next = NULL; local
38 next = *head;
39 item->next = next;
52 while (curr->next) {
53 prev = &(curr->next);
54 curr = curr->next;
[all...]
/haiku/src/system/kernel/vm/
H A DVMUserAddressSpace.cpp231 VMUserArea* next = fAreas.GetNext(static_cast<VMUserArea*>(area)); local
234 if (next == NULL)
237 if (next->Base() > newEnd)
244 return next->id == RESERVED_AREA_ID
245 && (uint64)next->cache_offset <= (uint64)area->Base()
246 && next->Base() + (next->Size() - 1) >= newEnd;
257 VMUserArea* next = fAreas.GetNext(area); local
258 if (next != NULL && next
453 VMUserArea* next; local
531 VMUserArea* next; local
[all...]
/haiku/src/add-ons/kernel/bus_managers/scsi/
H A Ddl_list.h16 item->prefix##prev->prefix##next = item->prefix##next; \
18 head = item->prefix##next; \
20 if( item->prefix##next ) \
21 item->prefix##next->prefix##prev = item->prefix##prev; \
26 item->prefix##next = head; \
37 item->prefix##next->prefix##prev = item->prefix##prev; \
38 item->prefix##prev->prefix##next = item->prefix##next; \
41 if( item->prefix##next !
[all...]
/haiku/src/add-ons/kernel/generic/locked_pool/
H A Ddl_list.h16 item->prefix##prev->prefix##next = item->prefix##next; \
18 head = item->prefix##next; \
20 if( item->prefix##next ) \
21 item->prefix##next->prefix##prev = item->prefix##prev; \
26 item->prefix##next = head; \
37 item->prefix##next->prefix##prev = item->prefix##prev; \
38 item->prefix##prev->prefix##next = item->prefix##next; \
41 if( item->prefix##next !
[all...]
/haiku/src/add-ons/kernel/generic/scsi_periph/
H A Ddl_list.h16 item->prefix##prev->prefix##next = item->prefix##next; \
18 head = item->prefix##next; \
20 if( item->prefix##next ) \
21 item->prefix##next->prefix##prev = item->prefix##prev; \
26 item->prefix##next = head; \
37 item->prefix##next->prefix##prev = item->prefix##prev; \
38 item->prefix##prev->prefix##next = item->prefix##next; \
41 if( item->prefix##next !
[all...]
/haiku/src/system/libroot/os/arch/arm/
H A Dtls.c26 int32 next = atomic_add(&gNextSlot, 1); local
27 if (next >= TLS_MAX_KEYS)
30 return next;
/haiku/src/system/libroot/os/arch/m68k/
H A Dtls.c26 int32 next = atomic_add(&gNextSlot, 1); local
27 if (next >= TLS_MAX_KEYS)
30 return next;
/haiku/src/system/libroot/os/arch/ppc/
H A Dtls.c26 int32 next = atomic_add(&gNextSlot, 1); local
27 if (next >= TLS_MAX_KEYS)
30 return next;
/haiku/src/system/libroot/os/arch/riscv64/
H A Dtls.c26 int32 next = atomic_add(&gNextSlot, 1); local
27 if (next >= TLS_MAX_KEYS)
30 return next;
/haiku/src/system/libroot/os/arch/sparc/
H A Dtls.c26 int32 next = atomic_add(&gNextSlot, 1); local
27 if (next >= TLS_MAX_KEYS)
30 return next;
/haiku/headers/private/kernel/boot/platform/bios_ia32/
H A Dbios_drive.h13 struct bios_drive *next; member in struct:bios_drive
/haiku/src/tools/fs_shell/
H A Dlist.cpp24 list->link.next = list->link.prev = &list->link;
44 link->next = list->link.next;
47 list->link.next->prev = link;
48 list->link.next = link;
60 link->next = &list->link;
63 list->link.prev->next = link;
77 link->next->prev = link->prev;
78 link->prev->next = link->next;
[all...]
/haiku/src/libs/libcxxrt/
H A Dcxa_atexit.c34 struct atexit_handler *next; member in struct:atexit_handler
49 h->next = head;
58 for (struct atexit_handler *h = head ; h ; h = h->next) {
60 *last = h->next;
64 last = &h->next;
/haiku/src/add-ons/mail_daemon/inbound_filters/match_header/
H A DStringMatcher.cpp157 char next = str[i]; local
158 if ((next >= 'A')&&(next <= 'Z'))
161 sprintf(buf, "[%c%c]", next, next+('a'-'A'));
165 else if ((next >= 'a')&&(next <= 'z'))
168 sprintf(buf, "[%c%c]", next, next+('A'-'a'));
172 else ret += next;
[all...]
/haiku/src/add-ons/kernel/drivers/graphics/common/
H A Dmemory_manager.c34 struct mem_block *prev, *next; member in struct:mem_block
58 mem_block *next = block->next; local
60 block->size += next->size;
62 if (next->next)
63 next->next->prev = block;
65 block->next = next
76 mem_block *prev, *next; local
[all...]
/haiku/src/servers/midi/
H A DPortDrivers.cpp91 uint8 next = 0; local
94 if (read(fFileDescriptor, &next, 1) != 1) {
106 if (next < 0x80) {
108 sysexBuf[sysexSize++] = next;
114 } else if ((next & 0xF8) == 0xF8) {
116 SpraySystemRealTime(next, timestamp);
122 if (next == B_SYS_EX_END) {
131 if ((next & 0xF8) == 0xF8) {
133 SpraySystemRealTime(next, timestamp);
134 } else if ((next
[all...]
/haiku/src/system/libnetwork/netresolv/include/isc/
H A Dlist.h26 #define LINK(type) struct { type *prev, *next; }
30 (elt)->link.next = (type *)(-1); \
35 (void *)((elt)->link.next) != (void *)(-1))
49 (elt)->link.next = (list).head; \
57 (list).tail->link.next = (elt); \
61 (elt)->link.next = NULL; \
68 if ((elt)->link.next != NULL) \
69 (elt)->link.next->link.prev = (elt)->link.prev; \
75 (elt)->link.prev->link.next = (elt)->link.next; \
[all...]
/haiku/src/add-ons/kernel/drivers/midi/usb_midi/
H A Ddevlist.cpp38 port->next = usbmidi_port_list;
52 usbmidi_port_list = port->next;
57 for (d = usbmidi_port_list; d != NULL; d = d->next) {
58 if (d->next == port) {
59 d->next = port->next;
77 for (port = usbmidi_port_list; port != NULL; port = port->next) {
94 for (port = usbmidi_port_list; port != NULL; port = port->next) {
97 break; /* try next higher */
145 for (i = 0, port = usbmidi_port_list; port != NULL; port = port->next) {
[all...]

Completed in 183 milliseconds

1234567891011>>