HelenOS sources
next 74 boot/generic/include/tar.h size_t next;
next 173 common/adt/hash_table.c list_foreach_safe(h->bucket[idx], cur, next) {
next 275 common/adt/hash_table.c for (link_t *cur = item->link.next; cur != &first->link;
next 276 common/adt/hash_table.c cur = cur->next) {
next 315 common/adt/hash_table.c list_foreach_safe(h->bucket[idx], cur, next) {
next 368 common/adt/hash_table.c list_foreach_safe(h->bucket[idx], cur, next) {
next 456 common/adt/hash_table.c list_foreach_safe(h->bucket[old_idx], cur, next) {
next 59 common/adt/list.c link_t *hlp = list->head.next;
next 66 common/adt/list.c hlp = hlp->next;
next 86 common/adt/list.c list->head.next->prev = pos;
next 87 common/adt/list.c list->head.prev->next = pos->next;
next 90 common/adt/list.c pos->next->prev = list->head.prev;
next 91 common/adt/list.c pos->next = list->head.next;
next 663 common/adt/odict.c odlink_t *next;
next 673 common/adt/odict.c next = cur->a;
next 675 common/adt/odict.c next = cur->b;
next 677 common/adt/odict.c if (next == NULL)
next 680 common/adt/odict.c cur = next;
next 718 common/adt/odict.c odlink_t *next;
next 728 common/adt/odict.c next = cur->b;
next 730 common/adt/odict.c next = cur->a;
next 732 common/adt/odict.c if (next == NULL)
next 735 common/adt/odict.c cur = next;
next 83 common/include/adt/list.h .next = &(name).head \
next 92 common/include/adt/list.h for (link_t *_link = (list).head.next; \
next 94 common/include/adt/list.h _link != &(list).head; _link = _link->next)
next 128 common/include/adt/list.h for (link_t *iterator = (list).head.next, \
next 129 common/include/adt/list.h *next_iter = iterator->next; \
next 131 common/include/adt/list.h iterator = next_iter, next_iter = iterator->next)
next 147 common/include/adt/list.h struct __adt_list_link *next; /**< Pointer to the next item in the list. */
next 162 common/include/adt/list.h return link->prev != NULL && link->next != NULL;
next 175 common/include/adt/list.h link->next = NULL;
next 188 common/include/adt/list.h list->head.next = &list->head;
next 196 common/include/adt/list.h lnew->next = lold;
next 198 common/include/adt/list.h lold->prev->next = lnew;
next 208 common/include/adt/list.h lnew->next = lold->next;
next 209 common/include/adt/list.h lold->next->prev = lnew;
next 210 common/include/adt/list.h lold->next = lnew;
next 249 common/include/adt/list.h if ((link->prev != NULL) && (link->next != NULL)) {
next 250 common/include/adt/list.h link->next->prev = link->prev;
next 251 common/include/adt/list.h link->prev->next = link->next;
next 266 common/include/adt/list.h return (list->head.next == &list->head);
next 279 common/include/adt/list.h return ((list->head.next == &list->head) ? NULL : list->head.next);
next 304 common/include/adt/list.h return (link->next == &list->head) ? NULL : link->next;
next 337 common/include/adt/list.h part1->prev->next = part2;
next 338 common/include/adt/list.h part2->prev->next = part1;
next 451 common/include/adt/list.h if (link->prev == NULL && link->next == NULL)
next 454 common/include/adt/list.h assert(link->prev != NULL && link->next != NULL);
next 1459 common/str.c char *str_tok(char *s, const char *delim, char **next)
next 1483 common/str.c if (next)
next 1484 common/str.c *next = (ch ? &s[tmp] : &s[cur]);
next 173 kernel/generic/common/adt/hash_table.c list_foreach_safe(h->bucket[idx], cur, next) {
next 275 kernel/generic/common/adt/hash_table.c for (link_t *cur = item->link.next; cur != &first->link;
next 276 kernel/generic/common/adt/hash_table.c cur = cur->next) {
next 315 kernel/generic/common/adt/hash_table.c list_foreach_safe(h->bucket[idx], cur, next) {
next 368 kernel/generic/common/adt/hash_table.c list_foreach_safe(h->bucket[idx], cur, next) {
next 456 kernel/generic/common/adt/hash_table.c list_foreach_safe(h->bucket[old_idx], cur, next) {
next 59 kernel/generic/common/adt/list.c link_t *hlp = list->head.next;
next 66 kernel/generic/common/adt/list.c hlp = hlp->next;
next 86 kernel/generic/common/adt/list.c list->head.next->prev = pos;
next 87 kernel/generic/common/adt/list.c list->head.prev->next = pos->next;
next 90 kernel/generic/common/adt/list.c pos->next->prev = list->head.prev;
next 91 kernel/generic/common/adt/list.c pos->next = list->head.next;
next 663 kernel/generic/common/adt/odict.c odlink_t *next;
next 673 kernel/generic/common/adt/odict.c next = cur->a;
next 675 kernel/generic/common/adt/odict.c next = cur->b;
next 677 kernel/generic/common/adt/odict.c if (next == NULL)
next 680 kernel/generic/common/adt/odict.c cur = next;
next 718 kernel/generic/common/adt/odict.c odlink_t *next;
next 728 kernel/generic/common/adt/odict.c next = cur->b;
next 730 kernel/generic/common/adt/odict.c next = cur->a;
next 732 kernel/generic/common/adt/odict.c if (next == NULL)
next 735 kernel/generic/common/adt/odict.c cur = next;
next 83 kernel/generic/common/include/adt/list.h .next = &(name).head \
next 92 kernel/generic/common/include/adt/list.h for (link_t *_link = (list).head.next; \
next 94 kernel/generic/common/include/adt/list.h _link != &(list).head; _link = _link->next)
next 128 kernel/generic/common/include/adt/list.h for (link_t *iterator = (list).head.next, \
next 129 kernel/generic/common/include/adt/list.h *next_iter = iterator->next; \
next 131 kernel/generic/common/include/adt/list.h iterator = next_iter, next_iter = iterator->next)
next 147 kernel/generic/common/include/adt/list.h struct __adt_list_link *next; /**< Pointer to the next item in the list. */
next 162 kernel/generic/common/include/adt/list.h return link->prev != NULL && link->next != NULL;
next 175 kernel/generic/common/include/adt/list.h link->next = NULL;
next 188 kernel/generic/common/include/adt/list.h list->head.next = &list->head;
next 196 kernel/generic/common/include/adt/list.h lnew->next = lold;
next 198 kernel/generic/common/include/adt/list.h lold->prev->next = lnew;
next 208 kernel/generic/common/include/adt/list.h lnew->next = lold->next;
next 209 kernel/generic/common/include/adt/list.h lold->next->prev = lnew;
next 210 kernel/generic/common/include/adt/list.h lold->next = lnew;
next 249 kernel/generic/common/include/adt/list.h if ((link->prev != NULL) && (link->next != NULL)) {
next 250 kernel/generic/common/include/adt/list.h link->next->prev = link->prev;
next 251 kernel/generic/common/include/adt/list.h link->prev->next = link->next;
next 266 kernel/generic/common/include/adt/list.h return (list->head.next == &list->head);
next 279 kernel/generic/common/include/adt/list.h return ((list->head.next == &list->head) ? NULL : list->head.next);
next 304 kernel/generic/common/include/adt/list.h return (link->next == &list->head) ? NULL : link->next;
next 337 kernel/generic/common/include/adt/list.h part1->prev->next = part2;
next 338 kernel/generic/common/include/adt/list.h part2->prev->next = part1;
next 451 kernel/generic/common/include/adt/list.h if (link->prev == NULL && link->next == NULL)
next 454 kernel/generic/common/include/adt/list.h assert(link->prev != NULL && link->next != NULL);
next 1459 kernel/generic/common/str.c char *str_tok(char *s, const char *delim, char **next)
next 1483 kernel/generic/common/str.c if (next)
next 1484 kernel/generic/common/str.c *next = (ch ? &s[tmp] : &s[cur]);
next 146 kernel/generic/include/sysinfo/sysinfo.h struct sysinfo_item *next; /**< Sibling item */
next 206 kernel/generic/src/cap/cap.c list_foreach_safe(task->cap_info->type_list[type], cur, next) {
next 94 kernel/generic/src/lib/ra.c nextseg = list_get_instance(seg->segment_link.next, ra_segment_t,
next 190 kernel/generic/src/lib/ra.c list_foreach_safe(span->segments, cur, next) {
next 223 kernel/generic/src/lib/ra.c list_foreach_safe(arena->spans, cur, next) {
next 394 kernel/generic/src/lib/ra.c succ = hash_table_get_inst(seg->segment_link.next, ra_segment_t,
next 72 kernel/generic/src/sysinfo/sysinfo.c item->next = NULL;
next 169 kernel/generic/src/sysinfo/sysinfo.c cur = cur->next;
next 276 kernel/generic/src/sysinfo/sysinfo.c if (cur->next == NULL) {
next 287 kernel/generic/src/sysinfo/sysinfo.c cur->next = item;
next 313 kernel/generic/src/sysinfo/sysinfo.c cur = cur->next;
next 527 kernel/generic/src/sysinfo/sysinfo.c for (sysinfo_item_t *cur = root; cur; cur = cur->next) {
next 748 kernel/generic/src/sysinfo/sysinfo.c for (sysinfo_item_t *cur = subtree; cur; cur = cur->next)
next 762 kernel/generic/src/sysinfo/sysinfo.c for (sysinfo_item_t *cur = subtree; cur; cur = cur->next) {
next 329 uspace/app/edit/sheet.c char32_t spt_next_char(spt_t spt, spt_t *next)
next 332 uspace/app/edit/sheet.c if (next)
next 333 uspace/app/edit/sheet.c *next = spt;
next 56 uspace/app/sbi/src/list.c list->head.next = &list->head;
next 68 uspace/app/sbi/src/list.c list->head.next = NULL;
next 129 uspace/app/sbi/src/list.c node = list->head.next;
next 161 uspace/app/sbi/src/list.c return (node->next != &list->head) ? node->next : NULL;
next 217 uspace/app/sbi/src/list.c node->next = NULL;
next 230 uspace/app/sbi/src/list.c assert(node->next == NULL);
next 247 uspace/app/sbi/src/list.c assert(n->next == NULL);
next 249 uspace/app/sbi/src/list.c n->next = b;
next 251 uspace/app/sbi/src/list.c assert(a->next == b);
next 253 uspace/app/sbi/src/list.c a->next = n;
next 267 uspace/app/sbi/src/list.c assert(n->next != NULL);
next 270 uspace/app/sbi/src/list.c b = n->next;
next 272 uspace/app/sbi/src/list.c assert(a->next == n);
next 275 uspace/app/sbi/src/list.c a->next = b;
next 279 uspace/app/sbi/src/list.c n->next = NULL;
next 292 uspace/app/sbi/src/list.c m = list->head.next;
next 296 uspace/app/sbi/src/list.c m = m->next;
next 35 uspace/app/sbi/src/list_t.h struct list_node *prev, *next;
next 490 uspace/app/taskbar/tbsmenu.c char *next;
next 499 uspace/app/taskbar/tbsmenu.c arg = str_tok(buf, " ", &next);
next 502 uspace/app/taskbar/tbsmenu.c arg = str_tok(next, " ", &next);
next 519 uspace/app/taskbar/tbsmenu.c arg = str_tok(buf, " ", &next);
next 528 uspace/app/taskbar/tbsmenu.c arg = str_tok(next, " ", &next);
next 280 uspace/app/taskbar/wndlist.c wndlist_entry_t *next;
next 285 uspace/app/taskbar/wndlist.c next = wndlist_next(entry);
next 317 uspace/app/taskbar/wndlist.c while (next != NULL) {
next 318 uspace/app/taskbar/wndlist.c e = next;
next 327 uspace/app/taskbar/wndlist.c next = wndlist_next(e);
next 109 uspace/app/taskdump/fibrildump.c addr = (uintptr_t) link.next;
next 320 uspace/dist/src/c/demos/edit/sheet.c char32_t spt_next_char(spt_t spt, spt_t *next)
next 323 uspace/dist/src/c/demos/edit/sheet.c if (next)
next 324 uspace/dist/src/c/demos/edit/sheet.c *next = spt;
next 348 uspace/drv/bus/isa/isa.c static char *str_get_line(char *str, char **next)
next 351 uspace/drv/bus/isa/isa.c *next = NULL;
next 362 uspace/drv/bus/isa/isa.c *next = str + 1;
next 175 uspace/drv/bus/usb/ehci/ehci_batch.c ehci_batch->qh->next, ehci_batch->qh->alternate);
next 193 uspace/drv/bus/usb/ehci/ehci_batch.c ehci_batch->tds[i].status, ehci_batch->tds[i].next,
next 227 uspace/drv/bus/usb/ehci/ehci_batch.c ehci_batch->qh->next = LINK_POINTER_TERM;
next 266 uspace/drv/bus/usb/ehci/ehci_batch.c ehci_batch->qh->next, ehci_batch->qh->alternate);
next 284 uspace/drv/bus/usb/ehci/ehci_batch.c ehci_batch->tds[0].status, ehci_batch->tds[0].next,
next 303 uspace/drv/bus/usb/ehci/ehci_batch.c ehci_batch->tds[td_current].next,
next 319 uspace/drv/bus/usb/ehci/ehci_batch.c ehci_batch->tds[td_current].next,
next 340 uspace/drv/bus/usb/ehci/ehci_batch.c ehci_batch->qh->next, ehci_batch->qh->alternate);
next 361 uspace/drv/bus/usb/ehci/ehci_batch.c ehci_batch->tds[td_current].next,
next 75 uspace/drv/bus/usb/ehci/endpoint_list.c void endpoint_list_chain(endpoint_list_t *instance, const endpoint_list_t *next)
next 78 uspace/drv/bus/usb/ehci/endpoint_list.c assert(next);
next 80 uspace/drv/bus/usb/ehci/endpoint_list.c assert(next->list_head);
next 83 uspace/drv/bus/usb/ehci/endpoint_list.c instance, instance->name, next, next->name);
next 85 uspace/drv/bus/usb/ehci/endpoint_list.c qh_append_qh(instance->list_head, next->list_head);
next 71 uspace/drv/bus/usb/ehci/endpoint_list.h void endpoint_list_chain(endpoint_list_t *instance, const endpoint_list_t *next);
next 362 uspace/drv/bus/usb/ehci/hc.c list_foreach_safe(hc->pending_endpoints, current, next) {
next 42 uspace/drv/bus/usb/ehci/hw_struct/iso_transfer_descriptor.h link_pointer_t next;
next 60 uspace/drv/bus/usb/ehci/hw_struct/queue_head.c EHCI_MEM32_WR(instance->next, LINK_POINTER_TERM);
next 55 uspace/drv/bus/usb/ehci/hw_struct/queue_head.h link_pointer_t next;
next 164 uspace/drv/bus/usb/ehci/hw_struct/queue_head.h static inline void qh_append_qh(qh_t *qh, const qh_t *next)
next 167 uspace/drv/bus/usb/ehci/hw_struct/queue_head.h assert(next);
next 168 uspace/drv/bus/usb/ehci/hw_struct/queue_head.h const uint32_t pa = addr_to_phys(next);
next 216 uspace/drv/bus/usb/ehci/hw_struct/queue_head.h EHCI_MEM32_WR(qh->next, LINK_POINTER_TD(td));
next 228 uspace/drv/bus/usb/ehci/hw_struct/queue_head.h return !(EHCI_MEM32_RD(qh->next) & LINK_POINTER_TERMINATE_FLAG);
next 42 uspace/drv/bus/usb/ehci/hw_struct/split_iso_transfer_descriptor.h link_pointer_t next;
next 113 uspace/drv/bus/usb/ehci/hw_struct/transfer_descriptor.c EHCI_MEM32_WR(instance->next, next_phys ?
next 45 uspace/drv/bus/usb/ehci/hw_struct/transfer_descriptor.h link_pointer_t next;
next 81 uspace/drv/bus/usb/ohci/endpoint_list.c const endpoint_list_t *instance, const endpoint_list_t *next)
next 84 uspace/drv/bus/usb/ohci/endpoint_list.c assert(next);
next 85 uspace/drv/bus/usb/ohci/endpoint_list.c ed_append_ed(instance->list_head, next->list_head);
next 115 uspace/drv/bus/usb/ohci/endpoint_list.c ep->ed->next = last_ed->next;
next 135 uspace/drv/bus/usb/ohci/endpoint_list.c last_ed->next);
next 170 uspace/drv/bus/usb/ohci/endpoint_list.c prev_ed->next = ep->ed->next;
next 175 uspace/drv/bus/usb/ohci/endpoint_list.c ep, qpos, instance->name, ep->ed->next);
next 75 uspace/drv/bus/usb/ohci/endpoint_list.h const endpoint_list_t *instance, const endpoint_list_t *next);
next 364 uspace/drv/bus/usb/ohci/hc.c list_foreach_safe(hc->pending_endpoints, current, next) {
next 107 uspace/drv/bus/usb/ohci/hw_struct/endpoint_descriptor.h volatile uint32_t next;
next 184 uspace/drv/bus/usb/ohci/hw_struct/endpoint_descriptor.h static inline void ed_append_ed(ed_t *instance, const ed_t *next)
next 187 uspace/drv/bus/usb/ohci/hw_struct/endpoint_descriptor.h assert(next);
next 188 uspace/drv/bus/usb/ohci/hw_struct/endpoint_descriptor.h const uint32_t pa = addr_to_phys(next);
next 190 uspace/drv/bus/usb/ohci/hw_struct/endpoint_descriptor.h OHCI_MEM32_WR(instance->next, pa);
next 196 uspace/drv/bus/usb/ohci/hw_struct/endpoint_descriptor.h return OHCI_MEM32_RD(instance->next) & ED_NEXT_PTR_MASK;
next 59 uspace/drv/bus/usb/ohci/hw_struct/iso_transfer_descriptor.h volatile uint32_t next;
next 63 uspace/drv/bus/usb/ohci/hw_struct/transfer_descriptor.c void td_init(td_t *instance, const td_t *next,
next 90 uspace/drv/bus/usb/ohci/hw_struct/transfer_descriptor.c td_set_next(instance, next);
next 93 uspace/drv/bus/usb/ohci/hw_struct/transfer_descriptor.c void td_set_next(td_t *instance, const td_t *next)
next 95 uspace/drv/bus/usb/ohci/hw_struct/transfer_descriptor.c OHCI_MEM32_WR(instance->next, addr_to_phys(next) & TD_NEXT_PTR_MASK);
next 85 uspace/drv/bus/usb/ohci/hw_struct/transfer_descriptor.h volatile uint32_t next;
next 160 uspace/drv/bus/usb/ohci/ohci_batch.c ohci_ep->ed->td_tail, ohci_ep->ed->next);
next 178 uspace/drv/bus/usb/ohci/ohci_batch.c ohci_batch->tds[i]->next, ohci_batch->tds[i]->be);
next 240 uspace/drv/bus/usb/ohci/ohci_batch.c ohci_ep->ed->td_head, ohci_ep->ed->next);
next 291 uspace/drv/bus/usb/ohci/ohci_batch.c ohci_batch->tds[0]->next, ohci_batch->tds[0]->be);
next 308 uspace/drv/bus/usb/ohci/ohci_batch.c ohci_batch->tds[td_current]->next,
next 324 uspace/drv/bus/usb/ohci/ohci_batch.c ohci_batch->tds[td_current]->next,
next 363 uspace/drv/bus/usb/ohci/ohci_batch.c ohci_batch->tds[td_current]->next,
next 640 uspace/drv/bus/usb/uhci/hc.c expected_pa = QH(interrupt)->next & LINK_POINTER_ADDRESS_MASK;
next 647 uspace/drv/bus/usb/uhci/hc.c expected_pa = QH(control_slow)->next & LINK_POINTER_ADDRESS_MASK;
next 654 uspace/drv/bus/usb/uhci/hc.c expected_pa = QH(control_full)->next & LINK_POINTER_ADDRESS_MASK;
next 49 uspace/drv/bus/usb/uhci/hw_struct/queue_head.h volatile link_pointer_t next;
next 68 uspace/drv/bus/usb/uhci/hw_struct/queue_head.h instance->next = LINK_POINTER_TERM;
next 78 uspace/drv/bus/usb/uhci/hw_struct/queue_head.h static inline void qh_set_next_qh(qh_t *instance, qh_t *next)
next 85 uspace/drv/bus/usb/uhci/hw_struct/queue_head.h const uint32_t pa = addr_to_phys(next);
next 87 uspace/drv/bus/usb/uhci/hw_struct/queue_head.h instance->next = LINK_POINTER_QH(pa);
next 89 uspace/drv/bus/usb/uhci/hw_struct/queue_head.h instance->next = LINK_POINTER_TERM;
next 70 uspace/drv/bus/usb/uhci/hw_struct/transfer_descriptor.c const td_t *next)
next 77 uspace/drv/bus/usb/uhci/hw_struct/transfer_descriptor.c const uint32_t next_pa = addr_to_phys(next);
next 80 uspace/drv/bus/usb/uhci/hw_struct/transfer_descriptor.c instance->next = 0 |
next 107 uspace/drv/bus/usb/uhci/hw_struct/transfer_descriptor.c instance, instance->next, instance->status, instance->device,
next 50 uspace/drv/bus/usb/uhci/hw_struct/transfer_descriptor.h link_pointer_t next;
next 102 uspace/drv/bus/usb/uhci/hw_struct/transfer_descriptor.h const void *buffer, const td_t *next);
next 96 uspace/drv/bus/usb/uhci/transfer_list.c void transfer_list_set_next(transfer_list_t *instance, transfer_list_t *next)
next 100 uspace/drv/bus/usb/uhci/transfer_list.c assert(next);
next 102 uspace/drv/bus/usb/uhci/transfer_list.c qh_set_next_qh(instance->queue_head, next->queue_head);
next 148 uspace/drv/bus/usb/uhci/transfer_list.c uhci_batch->qh->next = last_qh->next;
next 183 uspace/drv/bus/usb/uhci/transfer_list.c list_foreach_safe(instance->batch_list, current, next) {
next 242 uspace/drv/bus/usb/uhci/transfer_list.c assert((prev_qh->next & LINK_POINTER_ADDRESS_MASK) ==
next 244 uspace/drv/bus/usb/uhci/transfer_list.c prev_qh->next = uhci_batch->qh->next;
next 254 uspace/drv/bus/usb/uhci/transfer_list.c qpos, instance->name, uhci_batch->qh->next);
next 157 uspace/drv/bus/usb/xhci/trb_ring.c list_foreach_safe(ring->segments, cur, next) {
next 377 uspace/drv/bus/usb/xhci/trb_ring.c list_foreach_safe(ring->segments, cur, next) {
next 78 uspace/drv/nic/ne2k/dp8390.c uint8_t next;
next 511 uspace/drv/nic/ne2k/dp8390.c uint8_t next = header.next;
next 515 uspace/drv/nic/ne2k/dp8390.c next = current;
next 516 uspace/drv/nic/ne2k/dp8390.c } else if ((header.next < ne2k->start_page) ||
next 517 uspace/drv/nic/ne2k/dp8390.c (header.next > ne2k->stop_page)) {
next 518 uspace/drv/nic/ne2k/dp8390.c next = current;
next 525 uspace/drv/nic/ne2k/dp8390.c next = current;
next 546 uspace/drv/nic/ne2k/dp8390.c if (next == ne2k->start_page)
next 547 uspace/drv/nic/ne2k/dp8390.c next = ne2k->stop_page - 1;
next 549 uspace/drv/nic/ne2k/dp8390.c next--;
next 550 uspace/drv/nic/ne2k/dp8390.c pio_write_8(ne2k->port + DP_BNRY, next);
next 71 uspace/lib/bithenge/src/failure.c struct backtrace_item *next;
next 81 uspace/lib/bithenge/src/failure.c g_backtrace_items = first->next;
next 105 uspace/lib/bithenge/src/failure.c for (bip = &g_backtrace_items; *bip; bip = &(*bip)->next) {
next 109 uspace/lib/bithenge/src/failure.c *bip = bi->next;
next 110 uspace/lib/bithenge/src/failure.c bi->next = g_backtrace_items;
next 120 uspace/lib/bithenge/src/failure.c i->next = g_backtrace_items;
next 95 uspace/lib/bithenge/src/script.c struct transform_list *next;
next 413 uspace/lib/bithenge/src/script.c for (transform_list_t *e = state->transform_list; e; e = e->next) {
next 444 uspace/lib/bithenge/src/script.c entry->next = state->transform_list;
next 1319 uspace/lib/bithenge/src/script.c transform_list_t *next = entry->next;
next 1323 uspace/lib/bithenge/src/script.c entry = next;
next 173 uspace/lib/c/common/adt/hash_table.c list_foreach_safe(h->bucket[idx], cur, next) {
next 275 uspace/lib/c/common/adt/hash_table.c for (link_t *cur = item->link.next; cur != &first->link;
next 276 uspace/lib/c/common/adt/hash_table.c cur = cur->next) {
next 315 uspace/lib/c/common/adt/hash_table.c list_foreach_safe(h->bucket[idx], cur, next) {
next 368 uspace/lib/c/common/adt/hash_table.c list_foreach_safe(h->bucket[idx], cur, next) {
next 456 uspace/lib/c/common/adt/hash_table.c list_foreach_safe(h->bucket[old_idx], cur, next) {
next 59 uspace/lib/c/common/adt/list.c link_t *hlp = list->head.next;
next 66 uspace/lib/c/common/adt/list.c hlp = hlp->next;
next 86 uspace/lib/c/common/adt/list.c list->head.next->prev = pos;
next 87 uspace/lib/c/common/adt/list.c list->head.prev->next = pos->next;
next 90 uspace/lib/c/common/adt/list.c pos->next->prev = list->head.prev;
next 91 uspace/lib/c/common/adt/list.c pos->next = list->head.next;
next 663 uspace/lib/c/common/adt/odict.c odlink_t *next;
next 673 uspace/lib/c/common/adt/odict.c next = cur->a;
next 675 uspace/lib/c/common/adt/odict.c next = cur->b;
next 677 uspace/lib/c/common/adt/odict.c if (next == NULL)
next 680 uspace/lib/c/common/adt/odict.c cur = next;
next 718 uspace/lib/c/common/adt/odict.c odlink_t *next;
next 728 uspace/lib/c/common/adt/odict.c next = cur->b;
next 730 uspace/lib/c/common/adt/odict.c next = cur->a;
next 732 uspace/lib/c/common/adt/odict.c if (next == NULL)
next 735 uspace/lib/c/common/adt/odict.c cur = next;
next 83 uspace/lib/c/common/include/adt/list.h .next = &(name).head \
next 92 uspace/lib/c/common/include/adt/list.h for (link_t *_link = (list).head.next; \
next 94 uspace/lib/c/common/include/adt/list.h _link != &(list).head; _link = _link->next)
next 128 uspace/lib/c/common/include/adt/list.h for (link_t *iterator = (list).head.next, \
next 129 uspace/lib/c/common/include/adt/list.h *next_iter = iterator->next; \
next 131 uspace/lib/c/common/include/adt/list.h iterator = next_iter, next_iter = iterator->next)
next 147 uspace/lib/c/common/include/adt/list.h struct __adt_list_link *next; /**< Pointer to the next item in the list. */
next 162 uspace/lib/c/common/include/adt/list.h return link->prev != NULL && link->next != NULL;
next 175 uspace/lib/c/common/include/adt/list.h link->next = NULL;
next 188 uspace/lib/c/common/include/adt/list.h list->head.next = &list->head;
next 196 uspace/lib/c/common/include/adt/list.h lnew->next = lold;
next 198 uspace/lib/c/common/include/adt/list.h lold->prev->next = lnew;
next 208 uspace/lib/c/common/include/adt/list.h lnew->next = lold->next;
next 209 uspace/lib/c/common/include/adt/list.h lold->next->prev = lnew;
next 210 uspace/lib/c/common/include/adt/list.h lold->next = lnew;
next 249 uspace/lib/c/common/include/adt/list.h if ((link->prev != NULL) && (link->next != NULL)) {
next 250 uspace/lib/c/common/include/adt/list.h link->next->prev = link->prev;
next 251 uspace/lib/c/common/include/adt/list.h link->prev->next = link->next;
next 266 uspace/lib/c/common/include/adt/list.h return (list->head.next == &list->head);
next 279 uspace/lib/c/common/include/adt/list.h return ((list->head.next == &list->head) ? NULL : list->head.next);
next 304 uspace/lib/c/common/include/adt/list.h return (link->next == &list->head) ? NULL : link->next;
next 337 uspace/lib/c/common/include/adt/list.h part1->prev->next = part2;
next 338 uspace/lib/c/common/include/adt/list.h part2->prev->next = part1;
next 451 uspace/lib/c/common/include/adt/list.h if (link->prev == NULL && link->next == NULL)
next 454 uspace/lib/c/common/include/adt/list.h assert(link->prev != NULL && link->next != NULL);
next 1459 uspace/lib/c/common/str.c char *str_tok(char *s, const char *delim, char **next)
next 1483 uspace/lib/c/common/str.c if (next)
next 1484 uspace/lib/c/common/str.c *next = (ch ? &s[tmp] : &s[cur]);
next 156 uspace/lib/c/generic/malloc.c struct heap_area *next;
next 311 uspace/lib/c/generic/malloc.c area->next = NULL;
next 324 uspace/lib/c/generic/malloc.c last_heap_area->next = area;
next 425 uspace/lib/c/generic/malloc.c heap_area_t *next = area->next;
next 429 uspace/lib/c/generic/malloc.c prev->next = next;
next 431 uspace/lib/c/generic/malloc.c first_heap_area = next;
next 433 uspace/lib/c/generic/malloc.c if (next != NULL) {
next 434 uspace/lib/c/generic/malloc.c area_check(next);
next 435 uspace/lib/c/generic/malloc.c next->prev = prev;
next 527 uspace/lib/c/generic/malloc.c void *next = ((void *) cur) + size;
next 528 uspace/lib/c/generic/malloc.c block_init(next, cur->size - size, true, cur->area);
next 691 uspace/lib/c/generic/malloc.c area = area->next) {
next 765 uspace/lib/c/generic/malloc.c area = area->next) {
next 1024 uspace/lib/c/generic/malloc.c area = area->next) {
next 125 uspace/lib/c/generic/pio_trace.c list_foreach_safe(regions->list, it, next) {
next 603 uspace/lib/c/generic/thread/fibril.c link_t *tmp = timeout_list.head.next;
next 610 uspace/lib/c/generic/thread/fibril.c tmp = tmp->next;
next 65 uspace/lib/c/generic/thread/mpsc.c mpsc_node_t *next;
next 98 uspace/lib/c/generic/thread/mpsc.c mpsc_node_t *next = NULL;
next 100 uspace/lib/c/generic/thread/mpsc.c next = n->next;
next 102 uspace/lib/c/generic/thread/mpsc.c n = next;
next 119 uspace/lib/c/generic/thread/mpsc.c __atomic_store_n(&q->tail->next, n, __ATOMIC_RELEASE);
next 142 uspace/lib/c/generic/thread/mpsc.c n->next = NULL;
next 161 uspace/lib/c/generic/thread/mpsc.c new_head = __atomic_load_n(&n->next, __ATOMIC_ACQUIRE);
next 80 uspace/lib/c/generic/vfs/inbox.c inbox_entry *next = NULL;
next 99 uspace/lib/c/generic/vfs/inbox.c next = e;
next 112 uspace/lib/c/generic/vfs/inbox.c if (next == NULL) {
next 115 uspace/lib/c/generic/vfs/inbox.c list_insert_before((link_t *)entry, (link_t *)next);
next 229 uspace/lib/cpp/include/__bits/adt/hash_table.hpp if (node->next != node)
next 230 uspace/lib/cpp/include/__bits/adt/hash_table.hpp table_[idx].head = node->next;
next 288 uspace/lib/cpp/include/__bits/adt/hash_table.hpp current = current->next;
next 308 uspace/lib/cpp/include/__bits/adt/hash_table.hpp current = current->next;
next 423 uspace/lib/cpp/include/__bits/adt/hash_table.hpp auto next = current->next;
next 425 uspace/lib/cpp/include/__bits/adt/hash_table.hpp current->next = current;
next 444 uspace/lib/cpp/include/__bits/adt/hash_table.hpp current = next;
next 59 uspace/lib/cpp/include/__bits/adt/hash_table_bucket.hpp current = current->next;
next 91 uspace/lib/cpp/include/__bits/adt/hash_table_bucket.hpp current = current->next;
next 72 uspace/lib/cpp/include/__bits/adt/hash_table_iterators.hpp current_ = current_->next;
next 192 uspace/lib/cpp/include/__bits/adt/hash_table_iterators.hpp current_ = current_->next;
next 315 uspace/lib/cpp/include/__bits/adt/hash_table_iterators.hpp current_ = current_->next;
next 411 uspace/lib/cpp/include/__bits/adt/hash_table_iterators.hpp current_ = current_->next;
next 65 uspace/lib/cpp/include/__bits/adt/hash_table_policies.hpp current = current->next;
next 94 uspace/lib/cpp/include/__bits/adt/hash_table_policies.hpp if (current->next != head)
next 95 uspace/lib/cpp/include/__bits/adt/hash_table_policies.hpp table.table_[idx].head = current->next;
next 106 uspace/lib/cpp/include/__bits/adt/hash_table_policies.hpp current = current->next;
next 283 uspace/lib/cpp/include/__bits/adt/hash_table_policies.hpp current = current->next;
next 310 uspace/lib/cpp/include/__bits/adt/hash_table_policies.hpp current = current->next;
next 343 uspace/lib/cpp/include/__bits/adt/hash_table_policies.hpp current = current->next;
next 344 uspace/lib/cpp/include/__bits/adt/hash_table_policies.hpp tmp->next = tmp;
next 86 uspace/lib/cpp/include/__bits/adt/list.hpp if (current_->next == head_)
next 89 uspace/lib/cpp/include/__bits/adt/list.hpp current_ = current_->next;
next 216 uspace/lib/cpp/include/__bits/adt/list.hpp if (current_->next == head_)
next 219 uspace/lib/cpp/include/__bits/adt/list.hpp current_ = current_->next;
next 637 uspace/lib/cpp/include/__bits/adt/list.hpp if (head_->next == head_)
next 645 uspace/lib/cpp/include/__bits/adt/list.hpp head_->prev->next = head_->next;
next 646 uspace/lib/cpp/include/__bits/adt/list.hpp head_->next->prev = head_->prev;
next 647 uspace/lib/cpp/include/__bits/adt/list.hpp head_ = head_->next;
next 695 uspace/lib/cpp/include/__bits/adt/list.hpp target->prev->next = target->next;
next 696 uspace/lib/cpp/include/__bits/adt/list.hpp target->next->prev = target->prev;
next 697 uspace/lib/cpp/include/__bits/adt/list.hpp target = target->next;
next 744 uspace/lib/cpp/include/__bits/adt/list.hpp node = node->next;
next 748 uspace/lib/cpp/include/__bits/adt/list.hpp return iterator{position.node()->next, head_, false};
next 771 uspace/lib/cpp/include/__bits/adt/list.hpp head_ = node->next;
next 774 uspace/lib/cpp/include/__bits/adt/list.hpp auto next = node->next;
next 781 uspace/lib/cpp/include/__bits/adt/list.hpp return iterator{next, head_, size_ == 0U};
next 792 uspace/lib/cpp/include/__bits/adt/list.hpp auto next = last_node->next;
next 795 uspace/lib/cpp/include/__bits/adt/list.hpp last_node->next = nullptr;
next 796 uspace/lib/cpp/include/__bits/adt/list.hpp prev->next = next;
next 797 uspace/lib/cpp/include/__bits/adt/list.hpp next->prev = prev;
next 803 uspace/lib/cpp/include/__bits/adt/list.hpp head_ = next;
next 808 uspace/lib/cpp/include/__bits/adt/list.hpp first_node = first_node->next;
next 814 uspace/lib/cpp/include/__bits/adt/list.hpp return iterator{next, head_, size_ == 0U};
next 848 uspace/lib/cpp/include/__bits/adt/list.hpp prev->next = other_first;
next 851 uspace/lib/cpp/include/__bits/adt/list.hpp other_last->next = node;
next 875 uspace/lib/cpp/include/__bits/adt/list.hpp target->prev->next = target->next;
next 876 uspace/lib/cpp/include/__bits/adt/list.hpp target->next->prev = target->prev;
next 879 uspace/lib/cpp/include/__bits/adt/list.hpp node->prev->next = target;
next 883 uspace/lib/cpp/include/__bits/adt/list.hpp target->next = node;
next 917 uspace/lib/cpp/include/__bits/adt/list.hpp first.node()->prev->next = last.node();
next 927 uspace/lib/cpp/include/__bits/adt/list.hpp new_last->next = other.head_;
next 937 uspace/lib/cpp/include/__bits/adt/list.hpp first_node->prev->next = last.node();
next 945 uspace/lib/cpp/include/__bits/adt/list.hpp last_node->next = first_node;
next 950 uspace/lib/cpp/include/__bits/adt/list.hpp target->prev->next = first_node;
next 954 uspace/lib/cpp/include/__bits/adt/list.hpp last_node->next = target;
next 1107 uspace/lib/cpp/include/__bits/adt/list.hpp head_->prev->next = nullptr;
next 1111 uspace/lib/cpp/include/__bits/adt/list.hpp head_ = head_->next;
next 1175 uspace/lib/cpp/include/__bits/adt/list.hpp where = where->next;
next 1188 uspace/lib/cpp/include/__bits/adt/list.hpp head_->next->prev = head_->prev;
next 1189 uspace/lib/cpp/include/__bits/adt/list.hpp head_->prev->next = head_->next;
next 1190 uspace/lib/cpp/include/__bits/adt/list.hpp head_ = head_->next;
next 38 uspace/lib/cpp/include/__bits/adt/list_node.hpp list_node* next;
next 44 uspace/lib/cpp/include/__bits/adt/list_node.hpp next{}, prev{}
next 46 uspace/lib/cpp/include/__bits/adt/list_node.hpp next = this;
next 51 uspace/lib/cpp/include/__bits/adt/list_node.hpp : value{val}, next{}, prev{}
next 53 uspace/lib/cpp/include/__bits/adt/list_node.hpp next = this;
next 58 uspace/lib/cpp/include/__bits/adt/list_node.hpp : value{forward<T>(val)}, next{}, prev{}
next 60 uspace/lib/cpp/include/__bits/adt/list_node.hpp next = this;
next 69 uspace/lib/cpp/include/__bits/adt/list_node.hpp node->next = next;
next 71 uspace/lib/cpp/include/__bits/adt/list_node.hpp next->prev = node;
next 72 uspace/lib/cpp/include/__bits/adt/list_node.hpp next = node;
next 80 uspace/lib/cpp/include/__bits/adt/list_node.hpp node->next = this;
next 82 uspace/lib/cpp/include/__bits/adt/list_node.hpp prev->next = node;
next 88 uspace/lib/cpp/include/__bits/adt/list_node.hpp prev->next = next;
next 89 uspace/lib/cpp/include/__bits/adt/list_node.hpp next->prev = prev;
next 90 uspace/lib/cpp/include/__bits/adt/list_node.hpp next = this;
next 85 uspace/lib/cpp/include/__bits/adt/rbtree_iterators.hpp auto next = current_->successor();
next 86 uspace/lib/cpp/include/__bits/adt/rbtree_iterators.hpp if (next)
next 87 uspace/lib/cpp/include/__bits/adt/rbtree_iterators.hpp current_ = next;
next 114 uspace/lib/cpp/include/__bits/adt/rbtree_iterators.hpp auto next = current_->predecessor();
next 115 uspace/lib/cpp/include/__bits/adt/rbtree_iterators.hpp if (next)
next 116 uspace/lib/cpp/include/__bits/adt/rbtree_iterators.hpp current_ = next;
next 225 uspace/lib/cpp/include/__bits/adt/rbtree_iterators.hpp auto next = current_->successor();
next 226 uspace/lib/cpp/include/__bits/adt/rbtree_iterators.hpp if (next)
next 227 uspace/lib/cpp/include/__bits/adt/rbtree_iterators.hpp current_ = next;
next 254 uspace/lib/cpp/include/__bits/adt/rbtree_iterators.hpp auto next = current_->predecessor();
next 255 uspace/lib/cpp/include/__bits/adt/rbtree_iterators.hpp if (next)
next 256 uspace/lib/cpp/include/__bits/adt/rbtree_iterators.hpp current_ = next;
next 565 uspace/lib/cpp/include/__bits/adt/unordered_map.hpp current = current->next;
next 593 uspace/lib/cpp/include/__bits/adt/unordered_map.hpp current = current->next;
next 261 uspace/lib/cpp/include/__bits/io/sstream.hpp pos_type seekoff_(off_type off, char_type* begin, char_type*& next, char_type* end,
next 269 uspace/lib/cpp/include/__bits/io/sstream.hpp new_off = static_cast<off_type>(next - begin);
next 276 uspace/lib/cpp/include/__bits/io/sstream.hpp next = begin + new_off + off;
next 139 uspace/lib/cpp/include/__bits/utility/utility.hpp using type = typename make_integer_sequence<T, N - 1>::type::next;
next 111 uspace/lib/device/include/ipc/devman.h link_t *link = ids->ids.head.next;
next 118 uspace/lib/device/include/ipc/devman.h link = link->next;
next 1159 uspace/lib/ext4/src/ops.c uint64_t next;
next 1165 uspace/lib/ext4/src/ops.c next = it.current_offset;
next 1174 uspace/lib/ext4/src/ops.c *rbytes = next - pos;
next 546 uspace/lib/fs/libfs.c unsigned next = first;
next 569 uspace/lib/fs/libfs.c while (next != last) {
next 580 uspace/lib/fs/libfs.c last_next = next;
next 582 uspace/lib/fs/libfs.c rc = plb_get_component(component, &clen, &next, last);
next 377 uspace/lib/http/src/headers.c link_t *next = list_next(link, &headers->list);
next 381 uspace/lib/http/src/headers.c link = next;
next 563 uspace/lib/label/src/mbr.c label_part_t *next;
next 682 uspace/lib/label/src/mbr.c next = mbr_log_part_next(part);
next 683 uspace/lib/label/src/mbr.c if (next != NULL) {
next 688 uspace/lib/label/src/mbr.c next->hdr_blocks = pspec->hdr_blocks;
next 689 uspace/lib/label/src/mbr.c rc = mbr_ebr_create(label, next);
next 710 uspace/lib/label/src/mbr.c label_part_t *next;
next 750 uspace/lib/label/src/mbr.c next = mbr_log_part_next(part);
next 753 uspace/lib/label/src/mbr.c if (next != NULL) {
next 764 uspace/lib/label/src/mbr.c next->hdr_blocks = next->block0 - ep_b0;
next 766 uspace/lib/label/src/mbr.c rc = mbr_ebr_create(part->label, next);
next 979 uspace/lib/label/src/mbr.c label_part_t *next;
next 1000 uspace/lib/label/src/mbr.c next = mbr_log_part_next(part);
next 1003 uspace/lib/label/src/mbr.c if (next != NULL) {
next 1005 uspace/lib/label/src/mbr.c totsize = next->hdr_blocks + next->nblocks;
next 1008 uspace/lib/label/src/mbr.c pnext->first_lba = host2uint32_t_le(next->block0 -
next 1009 uspace/lib/label/src/mbr.c next->hdr_blocks - ep_b0);
next 61 uspace/lib/nic/include/nic.h struct nic_wol_virtue *next;
next 107 uspace/lib/nic/src/nic_wol_virtues.c nic_wol_virtue_t *next = virtue->next;
next 110 uspace/lib/nic/src/nic_wol_virtues.c virtue = next;
next 173 uspace/lib/nic/src/nic_wol_virtues.c virtue->next = wvs->lists[virtue->type];
next 202 uspace/lib/nic/src/nic_wol_virtues.c wvs->lists[virtue->type] = virtue->next;
next 205 uspace/lib/nic/src/nic_wol_virtues.c while (wv->next != virtue) {
next 206 uspace/lib/nic/src/nic_wol_virtues.c wv = wv->next;
next 209 uspace/lib/nic/src/nic_wol_virtues.c wv->next = virtue->next;
next 213 uspace/lib/nic/src/nic_wol_virtues.c virtue->next = NULL;
next 263 uspace/lib/nic/src/nic_wol_virtues.c virtue = virtue->next;
next 279 uspace/lib/nic/src/nic_wol_virtues.c virtue = virtue->next;
next 116 uspace/lib/pcut/include/pcut/datadef.h pcut_item_t *next;
next 54 uspace/lib/pcut/src/list.c item = item->next;
next 99 uspace/lib/pcut/src/list.c nested->nested->next = nested->next;
next 100 uspace/lib/pcut/src/list.c if (nested->next != NULL) {
next 101 uspace/lib/pcut/src/list.c nested->next->previous = nested->nested;
next 103 uspace/lib/pcut/src/list.c nested->next = first;
next 173 uspace/lib/pcut/src/list.c pcut_item_t *next, *it;
next 175 uspace/lib/pcut/src/list.c last->next = NULL;
next 179 uspace/lib/pcut/src/list.c next = last;
next 182 uspace/lib/pcut/src/list.c it->next = next;
next 184 uspace/lib/pcut/src/list.c next = it;
next 188 uspace/lib/pcut/src/list.c detect_skipped_tests(next);
next 190 uspace/lib/pcut/src/list.c set_ids(next);
next 192 uspace/lib/pcut/src/list.c return next;
next 68 uspace/lib/pcut/src/print.c it = it->next;
next 85 uspace/lib/pcut/src/run.c default_suite.next = NULL;
next 83 uspace/lib/posix/include/common/adt/list.h .next = &(name).head \
next 92 uspace/lib/posix/include/common/adt/list.h for (link_t *_link = (list).head.next; \
next 94 uspace/lib/posix/include/common/adt/list.h _link != &(list).head; _link = _link->next)
next 128 uspace/lib/posix/include/common/adt/list.h for (link_t *iterator = (list).head.next, \
next 129 uspace/lib/posix/include/common/adt/list.h *next_iter = iterator->next; \
next 131 uspace/lib/posix/include/common/adt/list.h iterator = next_iter, next_iter = iterator->next)
next 147 uspace/lib/posix/include/common/adt/list.h struct __adt_list_link *next; /**< Pointer to the next item in the list. */
next 162 uspace/lib/posix/include/common/adt/list.h return link->prev != NULL && link->next != NULL;
next 175 uspace/lib/posix/include/common/adt/list.h link->next = NULL;
next 188 uspace/lib/posix/include/common/adt/list.h list->head.next = &list->head;
next 196 uspace/lib/posix/include/common/adt/list.h lnew->next = lold;
next 198 uspace/lib/posix/include/common/adt/list.h lold->prev->next = lnew;
next 208 uspace/lib/posix/include/common/adt/list.h lnew->next = lold->next;
next 209 uspace/lib/posix/include/common/adt/list.h lold->next->prev = lnew;
next 210 uspace/lib/posix/include/common/adt/list.h lold->next = lnew;
next 249 uspace/lib/posix/include/common/adt/list.h if ((link->prev != NULL) && (link->next != NULL)) {
next 250 uspace/lib/posix/include/common/adt/list.h link->next->prev = link->prev;
next 251 uspace/lib/posix/include/common/adt/list.h link->prev->next = link->next;
next 266 uspace/lib/posix/include/common/adt/list.h return (list->head.next == &list->head);
next 279 uspace/lib/posix/include/common/adt/list.h return ((list->head.next == &list->head) ? NULL : list->head.next);
next 304 uspace/lib/posix/include/common/adt/list.h return (link->next == &list->head) ? NULL : link->next;
next 337 uspace/lib/posix/include/common/adt/list.h part1->prev->next = part2;
next 338 uspace/lib/posix/include/common/adt/list.h part2->prev->next = part1;
next 451 uspace/lib/posix/include/common/adt/list.h if (link->prev == NULL && link->next == NULL)
next 454 uspace/lib/posix/include/common/adt/list.h assert(link->prev != NULL && link->next != NULL);
next 385 uspace/lib/posix/src/signal.c link_t *iterator = _signal_queue.head.next;
next 386 uspace/lib/posix/src/signal.c link_t *next;
next 389 uspace/lib/posix/src/signal.c next = iterator->next;
next 401 uspace/lib/posix/src/signal.c iterator = next;
next 167 uspace/lib/posix/src/string.c char *strtok_r(char *s, const char *delim, char **next)
next 169 uspace/lib/posix/src/string.c return __strtok_r(s, delim, next);
next 612 uspace/lib/tbarcfg/src/tbarcfg.c smenu_entry_t *next;
next 614 uspace/lib/tbarcfg/src/tbarcfg.c next = tbarcfg_smenu_next(entry);
next 615 uspace/lib/tbarcfg/src/tbarcfg.c if (next == NULL) {
next 621 uspace/lib/tbarcfg/src/tbarcfg.c list_insert_after(&entry->lentries, &next->lentries);
next 330 uspace/lib/ui/src/filelist.c ui_file_list_entry_t *next;
next 399 uspace/lib/ui/src/filelist.c next = ui_file_list_next(cur);
next 400 uspace/lib/ui/src/filelist.c while (next != NULL && str_cmp(next->name, olddn) <= 0 &&
next 401 uspace/lib/ui/src/filelist.c next->isdir) {
next 402 uspace/lib/ui/src/filelist.c cur = next;
next 403 uspace/lib/ui/src/filelist.c next = ui_file_list_next(cur);
next 759 uspace/lib/ui/src/list.c ui_list_entry_t *next;
next 761 uspace/lib/ui/src/list.c next = ui_list_next(entry);
next 762 uspace/lib/ui/src/list.c if (next == NULL) {
next 768 uspace/lib/ui/src/list.c list_insert_after(&entry->lentries, &next->lentries);
next 772 uspace/lib/ui/src/list.c list->page = next;
next 773 uspace/lib/ui/src/list.c } else if (list->page == next) {
next 783 uspace/lib/ui/src/list.c list->cursor = next;
next 785 uspace/lib/ui/src/list.c } else if (list->cursor == next) {
next 787 uspace/lib/ui/src/list.c ui_list_cursor_move(list, next, list->cursor_idx - 1);
next 1140 uspace/lib/ui/src/list.c ui_list_entry_t *next;
next 1143 uspace/lib/ui/src/list.c next = ui_list_next(list->cursor);
next 1145 uspace/lib/ui/src/list.c if (next != NULL)
next 1146 uspace/lib/ui/src/list.c ui_list_cursor_move(list, next, next_idx);
next 1308 uspace/lib/ui/src/list.c ui_list_entry_t *next;
next 1316 uspace/lib/ui/src/list.c next = ui_list_next(list->page);
next 1317 uspace/lib/ui/src/list.c if (next == NULL)
next 1330 uspace/lib/ui/src/list.c list->page = next;
next 1371 uspace/lib/ui/src/list.c ui_list_entry_t *next;
next 1376 uspace/lib/ui/src/list.c next = ui_list_next(list->page);
next 1377 uspace/lib/ui/src/list.c if (next == NULL)
next 1390 uspace/lib/ui/src/list.c list->page = next;
next 1392 uspace/lib/ui/src/list.c next = ui_list_next(next);
next 854 uspace/lib/ui/test/filelist.c PCUT_TEST(next)
next 1602 uspace/lib/ui/test/list.c PCUT_TEST(next)
next 153 uspace/lib/usbdev/src/altiface.c const uint8_t *next = (iface_ptr == NULL) ?
next 157 uspace/lib/usbdev/src/altiface.c next - iterator->nested_descriptors;
next 111 uspace/lib/usbdev/src/dp.c const uint8_t *next = current + current_length;
next 113 uspace/lib/usbdev/src/dp.c if (!is_valid_descriptor_pointer(data, next)) {
next 117 uspace/lib/usbdev/src/dp.c return next;
next 196 uspace/lib/usbdev/src/dp.c const uint8_t *next = get_next_descriptor(data, parent);
next 197 uspace/lib/usbdev/src/dp.c if (next == NULL) {
next 201 uspace/lib/usbdev/src/dp.c if (is_nested_descriptor(parser, data, next, parent)) {
next 202 uspace/lib/usbdev/src/dp.c return next;
next 91 uspace/lib/usbhid/src/hiddescriptor.c link_t *path_it = report->collection_paths.head.next;
next 106 uspace/lib/usbhid/src/hiddescriptor.c path_it = path_it->next;
next 495 uspace/lib/usbhid/src/hidparser.c field_it = report_des->report_items.head.next;
next 497 uspace/lib/usbhid/src/hidparser.c field_it = field->ritems_link.next;
next 516 uspace/lib/usbhid/src/hidparser.c field_it = field_it->next;
next 549 uspace/lib/usbhid/src/hidparser.c report_it = report_des->reports_link.next;
next 552 uspace/lib/usbhid/src/hidparser.c report_it = report->reports.head.next;
next 563 uspace/lib/usbhid/src/hidparser.c report_it = report_it->next;
next 252 uspace/lib/usbhid/src/hidpath.c report_link = report_path->items.head.next;
next 253 uspace/lib/usbhid/src/hidpath.c path_link = path->items.head.next;
next 270 uspace/lib/usbhid/src/hidpath.c report_link = report_link->next;
next 271 uspace/lib/usbhid/src/hidpath.c path_link = path_link->next;
next 98 uspace/lib/virtio/virtio-pci.h ioport16_t next; /**< Continuation descriptor */
next 98 uspace/lib/virtio/virtio.c uint64_t addr, uint32_t len, uint16_t flags, uint16_t next)
next 104 uspace/lib/virtio/virtio.c pio_write_le16(&d->next, next);
next 113 uspace/lib/virtio/virtio.c return pio_read_le16(&d->next);
next 586 uspace/srv/audio/hound/hound.c list_foreach_safe(hound->connections, it, next) {
next 162 uspace/srv/bd/vbd/disk.c vbds_disk_t *cur, *next;
next 214 uspace/srv/bd/vbd/disk.c next = vbds_disk_next(cur);
next 225 uspace/srv/bd/vbd/disk.c cur = next;
next 437 uspace/srv/devman/driver.c link = driver->devices.head.next;
next 444 uspace/srv/devman/driver.c link = link->next;
next 486 uspace/srv/devman/driver.c link = driver->devices.head.next;
next 82 uspace/srv/devman/match.c link_t *drv_link = drv->match_ids.ids.head.next;
next 84 uspace/srv/devman/match.c link_t *dev_link = dev_head->next;
next 94 uspace/srv/devman/match.c dev_link = dev_link->next;
next 97 uspace/srv/devman/match.c drv_link = drv_link->next;
next 65 uspace/srv/fs/exfat/exfat_idx.c fs_index_t next;
next 83 uspace/srv/fs/exfat/exfat_idx.c u->next = 0;
next 221 uspace/srv/fs/exfat/exfat_idx.c *index = u->next++;
next 275 uspace/srv/fs/exfat/exfat_idx.c if (u->next == index + 1) {
next 277 uspace/srv/fs/exfat/exfat_idx.c u->next--;
next 286 uspace/srv/fs/exfat/exfat_idx.c for (lnk = u->freed_list.head.next; lnk != &u->freed_list.head;
next 287 uspace/srv/fs/exfat/exfat_idx.c lnk = lnk->next) {
next 299 uspace/srv/fs/exfat/exfat_idx.c if (lnk->next != &u->freed_list.head)
next 300 uspace/srv/fs/exfat/exfat_idx.c try_coalesce_intervals(lnk, lnk->next,
next 65 uspace/srv/fs/fat/fat_idx.c fs_index_t next;
next 83 uspace/srv/fs/fat/fat_idx.c u->next = 0;
next 221 uspace/srv/fs/fat/fat_idx.c *index = u->next++;
next 275 uspace/srv/fs/fat/fat_idx.c if (u->next == index + 1) {
next 277 uspace/srv/fs/fat/fat_idx.c u->next--;
next 286 uspace/srv/fs/fat/fat_idx.c for (lnk = u->freed_list.head.next; lnk != &u->freed_list.head;
next 287 uspace/srv/fs/fat/fat_idx.c lnk = lnk->next) {
next 299 uspace/srv/fs/fat/fat_idx.c if (lnk->next != &u->freed_list.head)
next 300 uspace/srv/fs/fat/fat_idx.c try_coalesce_intervals(lnk, lnk->next,
next 112 uspace/srv/hid/display/cfgclient.c link_t *next;
next 117 uspace/srv/hid/display/cfgclient.c next = list_next(cur, &cfgclient->events);
next 122 uspace/srv/hid/display/cfgclient.c cur = next;
next 213 uspace/srv/hid/display/client.c link_t *next;
next 218 uspace/srv/hid/display/client.c next = list_next(cur, &client->events);
next 224 uspace/srv/hid/display/client.c cur = next;
next 112 uspace/srv/hid/display/wmclient.c link_t *next;
next 117 uspace/srv/hid/display/wmclient.c next = list_next(cur, &wmclient->events);
next 122 uspace/srv/hid/display/wmclient.c cur = next;
next 93 uspace/srv/net/inetsrv/icmpv6.c phdr.next = IP_PROTO_ICMPV6;
next 194 uspace/srv/net/inetsrv/icmpv6.c phdr.next = IP_PROTO_ICMPV6;
next 105 uspace/srv/net/inetsrv/icmpv6_std.h uint8_t next;
next 113 uspace/srv/net/inetsrv/inet_std.h uint8_t next;
next 125 uspace/srv/net/inetsrv/inet_std.h uint8_t next;
next 273 uspace/srv/net/inetsrv/pdu.c hdr6->next = IP6_NEXT_FRAGMENT;
next 278 uspace/srv/net/inetsrv/pdu.c hdr6f->next = packet->proto;
next 286 uspace/srv/net/inetsrv/pdu.c hdr6->next = packet->proto;
next 417 uspace/srv/net/inetsrv/pdu.c uint16_t next;
next 421 uspace/srv/net/inetsrv/pdu.c if (hdr6->next == IP6_NEXT_FRAGMENT) {
next 429 uspace/srv/net/inetsrv/pdu.c next = hdr6f->next;
next 436 uspace/srv/net/inetsrv/pdu.c next = hdr6->next;
next 449 uspace/srv/net/inetsrv/pdu.c packet->proto = next;
next 515 uspace/srv/net/inetsrv/pdu.c phdr.next = IP_PROTO_ICMPV6;
next 110 uspace/srv/net/tcp/ncsim.c link = link->next;
next 175 uspace/srv/net/tcp/pdu.c phdr6->next = IP_PROTO_TCP;
next 102 uspace/srv/net/tcp/std.h uint8_t next;
next 247 uspace/srv/net/tcp/tqueue.c link_t *cur, *next;
next 252 uspace/srv/net/tcp/tqueue.c cur = conn->retransmit.list.head.next;
next 255 uspace/srv/net/tcp/tqueue.c next = cur->next;
next 280 uspace/srv/net/tcp/tqueue.c cur = next;
next 112 uspace/srv/net/udp/pdu.c phdr6->next = IP_PROTO_UDP;
next 81 uspace/srv/net/udp/std.h uint8_t next;
next 251 uspace/srv/vfs/vfs_lookup.c size_t next = first;
next 267 uspace/srv/vfs/vfs_lookup.c rc = out_lookup((vfs_triplet_t *) base, &next, &nlen, lflag,
next 98 uspace/srv/volsrv/part.c link_t *cur, *next;
next 145 uspace/srv/volsrv/part.c next = list_next(cur, &parts->parts);
next 163 uspace/srv/volsrv/part.c cur = next;
HelenOS homepage, sources at GitHub