HelenOS sources
prev 86 common/adt/list.c list->head.next->prev = pos;
prev 87 common/adt/list.c list->head.prev->next = pos->next;
prev 90 common/adt/list.c pos->next->prev = list->head.prev;
prev 82 common/include/adt/list.h .prev = &(name).head, \
prev 98 common/include/adt/list.h for (link_t *_link = (list).head.prev; \
prev 100 common/include/adt/list.h _link != &(list).head; _link = _link->prev)
prev 146 common/include/adt/list.h struct __adt_list_link *prev; /**< Pointer to the previous item in the list. */
prev 162 common/include/adt/list.h return link->prev != NULL && link->next != NULL;
prev 174 common/include/adt/list.h link->prev = NULL;
prev 187 common/include/adt/list.h list->head.prev = &list->head;
prev 197 common/include/adt/list.h lnew->prev = lold->prev;
prev 198 common/include/adt/list.h lold->prev->next = lnew;
prev 199 common/include/adt/list.h lold->prev = lnew;
prev 207 common/include/adt/list.h lnew->prev = lold;
prev 209 common/include/adt/list.h lold->next->prev = lnew;
prev 249 common/include/adt/list.h if ((link->prev != NULL) && (link->next != NULL)) {
prev 250 common/include/adt/list.h link->next->prev = link->prev;
prev 251 common/include/adt/list.h link->prev->next = link->next;
prev 292 common/include/adt/list.h return (list->head.prev == &list->head) ? NULL : list->head.prev;
prev 316 common/include/adt/list.h return (link->prev == &list->head) ? NULL : link->prev;
prev 337 common/include/adt/list.h part1->prev->next = part2;
prev 338 common/include/adt/list.h part2->prev->next = part1;
prev 340 common/include/adt/list.h link_t *hlp = part1->prev;
prev 342 common/include/adt/list.h part1->prev = part2->prev;
prev 343 common/include/adt/list.h part2->prev = hlp;
prev 407 common/include/adt/list.h list_splice(list2, list1->head.prev);
prev 451 common/include/adt/list.h if (link->prev == NULL && link->next == NULL)
prev 454 common/include/adt/list.h assert(link->prev != NULL && link->next != NULL);
prev 44 kernel/arch/abs32le/src/debug/stacktrace.c bool kernel_frame_pointer_prev(stack_trace_context_t *ctx, uintptr_t *prev)
prev 59 kernel/arch/abs32le/src/debug/stacktrace.c bool uspace_frame_pointer_prev(stack_trace_context_t *ctx, uintptr_t *prev)
prev 48 kernel/arch/amd64/src/debug/stacktrace.c bool kernel_frame_pointer_prev(stack_trace_context_t *ctx, uintptr_t *prev)
prev 51 kernel/arch/amd64/src/debug/stacktrace.c *prev = stack[FRAME_OFFSET_FP_PREV];
prev 69 kernel/arch/amd64/src/debug/stacktrace.c bool uspace_frame_pointer_prev(stack_trace_context_t *ctx, uintptr_t *prev)
prev 71 kernel/arch/amd64/src/debug/stacktrace.c return !copy_from_uspace(prev,
prev 72 kernel/arch/amd64/src/debug/stacktrace.c ctx->fp + sizeof(uintptr_t) * FRAME_OFFSET_FP_PREV, sizeof(*prev));
prev 47 kernel/arch/arm32/src/debug/stacktrace.c bool kernel_frame_pointer_prev(stack_trace_context_t *ctx, uintptr_t *prev)
prev 51 kernel/arch/arm32/src/debug/stacktrace.c *prev = stack[FRAME_OFFSET_FP_PREV];
prev 68 kernel/arch/arm32/src/debug/stacktrace.c bool uspace_frame_pointer_prev(stack_trace_context_t *ctx, uintptr_t *prev)
prev 70 kernel/arch/arm32/src/debug/stacktrace.c return !copy_from_uspace(prev,
prev 71 kernel/arch/arm32/src/debug/stacktrace.c ctx->fp + sizeof(uintptr_t) * FRAME_OFFSET_FP_PREV, sizeof(*prev));
prev 47 kernel/arch/arm64/src/debug/stacktrace.c bool kernel_frame_pointer_prev(stack_trace_context_t *ctx, uintptr_t *prev)
prev 51 kernel/arch/arm64/src/debug/stacktrace.c *prev = stack[FRAME_OFFSET_FP_PREV];
prev 68 kernel/arch/arm64/src/debug/stacktrace.c bool uspace_frame_pointer_prev(stack_trace_context_t *ctx, uintptr_t *prev)
prev 70 kernel/arch/arm64/src/debug/stacktrace.c return !copy_from_uspace(prev,
prev 71 kernel/arch/arm64/src/debug/stacktrace.c ctx->fp + sizeof(uintptr_t) * FRAME_OFFSET_FP_PREV, sizeof(*prev));
prev 48 kernel/arch/ia32/src/debug/stacktrace.c bool kernel_frame_pointer_prev(stack_trace_context_t *ctx, uintptr_t *prev)
prev 51 kernel/arch/ia32/src/debug/stacktrace.c *prev = stack[FRAME_OFFSET_FP_PREV];
prev 67 kernel/arch/ia32/src/debug/stacktrace.c bool uspace_frame_pointer_prev(stack_trace_context_t *ctx, uintptr_t *prev)
prev 69 kernel/arch/ia32/src/debug/stacktrace.c return !copy_from_uspace(prev,
prev 70 kernel/arch/ia32/src/debug/stacktrace.c ctx->fp + sizeof(uintptr_t) * FRAME_OFFSET_FP_PREV, sizeof(*prev));
prev 45 kernel/arch/ia64/src/debug/stacktrace.c bool kernel_frame_pointer_prev(stack_trace_context_t *ctx, uintptr_t *prev)
prev 60 kernel/arch/ia64/src/debug/stacktrace.c bool uspace_frame_pointer_prev(stack_trace_context_t *ctx, uintptr_t *prev)
prev 249 kernel/arch/mips32/src/debug/stacktrace.c bool kernel_frame_pointer_prev(stack_trace_context_t *ctx, uintptr_t *prev)
prev 251 kernel/arch/mips32/src/debug/stacktrace.c return scan(ctx, prev, NULL);
prev 264 kernel/arch/mips32/src/debug/stacktrace.c bool uspace_frame_pointer_prev(stack_trace_context_t *ctx, uintptr_t *prev)
prev 48 kernel/arch/ppc32/src/debug/stacktrace.c bool kernel_frame_pointer_prev(stack_trace_context_t *ctx, uintptr_t *prev)
prev 51 kernel/arch/ppc32/src/debug/stacktrace.c *prev = stack[FRAME_OFFSET_FP_PREV];
prev 67 kernel/arch/ppc32/src/debug/stacktrace.c bool uspace_frame_pointer_prev(stack_trace_context_t *ctx, uintptr_t *prev)
prev 69 kernel/arch/ppc32/src/debug/stacktrace.c return !copy_from_uspace(prev,
prev 70 kernel/arch/ppc32/src/debug/stacktrace.c ctx->fp + sizeof(uintptr_t) * FRAME_OFFSET_FP_PREV, sizeof(*prev));
prev 45 kernel/arch/riscv64/src/debug/stacktrace.c bool kernel_frame_pointer_prev(stack_trace_context_t *ctx, uintptr_t *prev)
prev 60 kernel/arch/riscv64/src/debug/stacktrace.c bool uspace_frame_pointer_prev(stack_trace_context_t *ctx, uintptr_t *prev)
prev 74 kernel/arch/sparc64/src/debug/stacktrace.c bool kernel_frame_pointer_prev(stack_trace_context_t *ctx, uintptr_t *prev)
prev 78 kernel/arch/sparc64/src/debug/stacktrace.c *prev = stack[FRAME_OFFSET_FP_PREV] + STACK_BIAS;
prev 95 kernel/arch/sparc64/src/debug/stacktrace.c bool uspace_frame_pointer_prev(stack_trace_context_t *ctx, uintptr_t *prev)
prev 86 kernel/generic/common/adt/list.c list->head.next->prev = pos;
prev 87 kernel/generic/common/adt/list.c list->head.prev->next = pos->next;
prev 90 kernel/generic/common/adt/list.c pos->next->prev = list->head.prev;
prev 82 kernel/generic/common/include/adt/list.h .prev = &(name).head, \
prev 98 kernel/generic/common/include/adt/list.h for (link_t *_link = (list).head.prev; \
prev 100 kernel/generic/common/include/adt/list.h _link != &(list).head; _link = _link->prev)
prev 146 kernel/generic/common/include/adt/list.h struct __adt_list_link *prev; /**< Pointer to the previous item in the list. */
prev 162 kernel/generic/common/include/adt/list.h return link->prev != NULL && link->next != NULL;
prev 174 kernel/generic/common/include/adt/list.h link->prev = NULL;
prev 187 kernel/generic/common/include/adt/list.h list->head.prev = &list->head;
prev 197 kernel/generic/common/include/adt/list.h lnew->prev = lold->prev;
prev 198 kernel/generic/common/include/adt/list.h lold->prev->next = lnew;
prev 199 kernel/generic/common/include/adt/list.h lold->prev = lnew;
prev 207 kernel/generic/common/include/adt/list.h lnew->prev = lold;
prev 209 kernel/generic/common/include/adt/list.h lold->next->prev = lnew;
prev 249 kernel/generic/common/include/adt/list.h if ((link->prev != NULL) && (link->next != NULL)) {
prev 250 kernel/generic/common/include/adt/list.h link->next->prev = link->prev;
prev 251 kernel/generic/common/include/adt/list.h link->prev->next = link->next;
prev 292 kernel/generic/common/include/adt/list.h return (list->head.prev == &list->head) ? NULL : list->head.prev;
prev 316 kernel/generic/common/include/adt/list.h return (link->prev == &list->head) ? NULL : link->prev;
prev 337 kernel/generic/common/include/adt/list.h part1->prev->next = part2;
prev 338 kernel/generic/common/include/adt/list.h part2->prev->next = part1;
prev 340 kernel/generic/common/include/adt/list.h link_t *hlp = part1->prev;
prev 342 kernel/generic/common/include/adt/list.h part1->prev = part2->prev;
prev 343 kernel/generic/common/include/adt/list.h part2->prev = hlp;
prev 407 kernel/generic/common/include/adt/list.h list_splice(list2, list1->head.prev);
prev 451 kernel/generic/common/include/adt/list.h if (link->prev == NULL && link->next == NULL)
prev 454 kernel/generic/common/include/adt/list.h assert(link->prev != NULL && link->next != NULL);
prev 213 kernel/generic/src/console/console.c bool prev = console_override;
prev 219 kernel/generic/src/console/console.c if ((stdin) && (!prev)) {
prev 649 kernel/generic/src/console/kconsole.c size_t prev = *start;
prev 655 kernel/generic/src/console/kconsole.c *start = prev;
prev 663 kernel/generic/src/console/kconsole.c prev = offset;
prev 665 kernel/generic/src/console/kconsole.c *end = prev;
prev 372 kernel/generic/src/lib/ra.c pred = hash_table_get_inst(seg->segment_link.prev,
prev 277 uspace/app/barber/barber.c struct timespec prev;
prev 279 uspace/app/barber/barber.c getuptime(&prev);
prev 296 uspace/app/barber/barber.c plan_frame_timer(NSEC2USEC(ts_sub_diff(&cur, &prev)));
prev 203 uspace/app/edit/sheet.c size_t off, prev;
prev 210 uspace/app/edit/sheet.c prev = off = 0;
prev 212 uspace/app/edit/sheet.c prev = off;
prev 217 uspace/app/edit/sheet.c copy_sz = prev;
prev 337 uspace/app/edit/sheet.c char32_t spt_prev_char(spt_t spt, spt_t *prev)
prev 340 uspace/app/edit/sheet.c if (prev)
prev 341 uspace/app/edit/sheet.c *prev = spt;
prev 331 uspace/app/sbi/src/lex.c return &lex->prev;
prev 346 uspace/app/sbi/src/lex.c lex->prev = lex->current;
prev 181 uspace/app/sbi/src/lex_t.h lem_t prev;
prev 55 uspace/app/sbi/src/list.c list->head.prev = &list->head;
prev 67 uspace/app/sbi/src/list.c list->head.prev = NULL;
prev 83 uspace/app/sbi/src/list.c list_node_insert_between(node, list->head.prev, &list->head);
prev 98 uspace/app/sbi/src/list.c list_node_insert_between(node, list->head.prev, &list->head);
prev 144 uspace/app/sbi/src/list.c node = list->head.prev;
prev 176 uspace/app/sbi/src/list.c return (node->prev != &list->head) ? node->prev : NULL;
prev 216 uspace/app/sbi/src/list.c node->prev = NULL;
prev 229 uspace/app/sbi/src/list.c assert(node->prev == NULL);
prev 246 uspace/app/sbi/src/list.c assert(n->prev == NULL);
prev 248 uspace/app/sbi/src/list.c n->prev = a;
prev 252 uspace/app/sbi/src/list.c assert(b->prev == a);
prev 254 uspace/app/sbi/src/list.c b->prev = n;
prev 266 uspace/app/sbi/src/list.c assert(n->prev != NULL);
prev 269 uspace/app/sbi/src/list.c a = n->prev;
prev 273 uspace/app/sbi/src/list.c assert(b->prev == n);
prev 276 uspace/app/sbi/src/list.c b->prev = a;
prev 278 uspace/app/sbi/src/list.c n->prev = NULL;
prev 35 uspace/app/sbi/src/list_t.h struct list_node *prev, *next;
prev 187 uspace/app/websrv/websrv.c char prev = c;
prev 194 uspace/app/websrv/websrv.c if ((prev == '\r') && (c == '\n'))
prev 194 uspace/dist/src/c/demos/edit/sheet.c size_t off, prev;
prev 201 uspace/dist/src/c/demos/edit/sheet.c prev = off = 0;
prev 203 uspace/dist/src/c/demos/edit/sheet.c prev = off;
prev 208 uspace/dist/src/c/demos/edit/sheet.c copy_sz = prev;
prev 328 uspace/dist/src/c/demos/edit/sheet.c char32_t spt_prev_char(spt_t spt, spt_t *prev)
prev 331 uspace/dist/src/c/demos/edit/sheet.c if (prev)
prev 332 uspace/dist/src/c/demos/edit/sheet.c *prev = spt;
prev 168 uspace/drv/bus/usb/ehci/endpoint_list.c prev_qh = ehci_endpoint_list_instance(ep->eplist_link.prev)->qh;
prev 164 uspace/drv/bus/usb/ohci/endpoint_list.c ohci_endpoint_t *prev =
prev 165 uspace/drv/bus/usb/ohci/endpoint_list.c list_get_instance(ep->eplist_link.prev, ohci_endpoint_t, eplist_link);
prev 166 uspace/drv/bus/usb/ohci/endpoint_list.c prev_ed = prev->ed;
prev 239 uspace/drv/bus/usb/uhci/transfer_list.c uhci_transfer_batch_from_link(uhci_batch->link.prev)->qh;
prev 1088 uspace/drv/nic/rtl8169/driver.c rtl8169_descr_t *descr, *prev;
prev 1123 uspace/drv/nic/rtl8169/driver.c prev = &rtl8169->tx_ring[(head - 1) % TX_BUFFERS_COUNT];
prev 1125 uspace/drv/nic/rtl8169/driver.c ddf_msg(LVL_DEBUG, "current_descr=%p, prev_descr=%p", descr, prev);
prev 42 uspace/lib/c/arch/abs32le/src/stacktrace.c errno_t stacktrace_fp_prev(stacktrace_t *st, uintptr_t fp, uintptr_t *prev)
prev 51 uspace/lib/c/arch/amd64/src/stacktrace.c errno_t stacktrace_fp_prev(stacktrace_t *st, uintptr_t fp, uintptr_t *prev)
prev 53 uspace/lib/c/arch/amd64/src/stacktrace.c return (*st->ops->read_uintptr)(st->op_arg, fp + FRAME_OFFSET_FP_PREV, prev);
prev 51 uspace/lib/c/arch/arm32/src/stacktrace.c errno_t stacktrace_fp_prev(stacktrace_t *st, uintptr_t fp, uintptr_t *prev)
prev 53 uspace/lib/c/arch/arm32/src/stacktrace.c return (*st->ops->read_uintptr)(st->op_arg, fp + FRAME_OFFSET_FP_PREV, prev);
prev 49 uspace/lib/c/arch/arm64/src/stacktrace.c errno_t stacktrace_fp_prev(stacktrace_t *st, uintptr_t fp, uintptr_t *prev)
prev 52 uspace/lib/c/arch/arm64/src/stacktrace.c prev);
prev 51 uspace/lib/c/arch/ia32/src/stacktrace.c errno_t stacktrace_fp_prev(stacktrace_t *st, uintptr_t fp, uintptr_t *prev)
prev 53 uspace/lib/c/arch/ia32/src/stacktrace.c return (*st->ops->read_uintptr)(st->op_arg, fp + FRAME_OFFSET_FP_PREV, prev);
prev 50 uspace/lib/c/arch/ia64/src/stacktrace.c errno_t stacktrace_fp_prev(stacktrace_t *st, uintptr_t fp, uintptr_t *prev)
prev 54 uspace/lib/c/arch/ia64/src/stacktrace.c (void) prev;
prev 50 uspace/lib/c/arch/mips32/src/stacktrace.c errno_t stacktrace_fp_prev(stacktrace_t *st, uintptr_t fp, uintptr_t *prev)
prev 54 uspace/lib/c/arch/mips32/src/stacktrace.c (void) prev;
prev 51 uspace/lib/c/arch/ppc32/src/stacktrace.c errno_t stacktrace_fp_prev(stacktrace_t *st, uintptr_t fp, uintptr_t *prev)
prev 53 uspace/lib/c/arch/ppc32/src/stacktrace.c return (*st->ops->read_uintptr)(st->op_arg, fp + FRAME_OFFSET_FP_PREV, prev);
prev 41 uspace/lib/c/arch/riscv64/src/stacktrace.c errno_t stacktrace_fp_prev(stacktrace_t *st, uintptr_t fp, uintptr_t *prev)
prev 52 uspace/lib/c/arch/sparc64/src/stacktrace.c errno_t stacktrace_fp_prev(stacktrace_t *st, uintptr_t fp, uintptr_t *prev)
prev 59 uspace/lib/c/arch/sparc64/src/stacktrace.c *prev = bprev + STACK_BIAS;
prev 86 uspace/lib/c/common/adt/list.c list->head.next->prev = pos;
prev 87 uspace/lib/c/common/adt/list.c list->head.prev->next = pos->next;
prev 90 uspace/lib/c/common/adt/list.c pos->next->prev = list->head.prev;
prev 82 uspace/lib/c/common/include/adt/list.h .prev = &(name).head, \
prev 98 uspace/lib/c/common/include/adt/list.h for (link_t *_link = (list).head.prev; \
prev 100 uspace/lib/c/common/include/adt/list.h _link != &(list).head; _link = _link->prev)
prev 146 uspace/lib/c/common/include/adt/list.h struct __adt_list_link *prev; /**< Pointer to the previous item in the list. */
prev 162 uspace/lib/c/common/include/adt/list.h return link->prev != NULL && link->next != NULL;
prev 174 uspace/lib/c/common/include/adt/list.h link->prev = NULL;
prev 187 uspace/lib/c/common/include/adt/list.h list->head.prev = &list->head;
prev 197 uspace/lib/c/common/include/adt/list.h lnew->prev = lold->prev;
prev 198 uspace/lib/c/common/include/adt/list.h lold->prev->next = lnew;
prev 199 uspace/lib/c/common/include/adt/list.h lold->prev = lnew;
prev 207 uspace/lib/c/common/include/adt/list.h lnew->prev = lold;
prev 209 uspace/lib/c/common/include/adt/list.h lold->next->prev = lnew;
prev 249 uspace/lib/c/common/include/adt/list.h if ((link->prev != NULL) && (link->next != NULL)) {
prev 250 uspace/lib/c/common/include/adt/list.h link->next->prev = link->prev;
prev 251 uspace/lib/c/common/include/adt/list.h link->prev->next = link->next;
prev 292 uspace/lib/c/common/include/adt/list.h return (list->head.prev == &list->head) ? NULL : list->head.prev;
prev 316 uspace/lib/c/common/include/adt/list.h return (link->prev == &list->head) ? NULL : link->prev;
prev 337 uspace/lib/c/common/include/adt/list.h part1->prev->next = part2;
prev 338 uspace/lib/c/common/include/adt/list.h part2->prev->next = part1;
prev 340 uspace/lib/c/common/include/adt/list.h link_t *hlp = part1->prev;
prev 342 uspace/lib/c/common/include/adt/list.h part1->prev = part2->prev;
prev 343 uspace/lib/c/common/include/adt/list.h part2->prev = hlp;
prev 407 uspace/lib/c/common/include/adt/list.h list_splice(list2, list1->head.prev);
prev 451 uspace/lib/c/common/include/adt/list.h if (link->prev == NULL && link->next == NULL)
prev 454 uspace/lib/c/common/include/adt/list.h assert(link->prev != NULL && link->next != NULL);
prev 153 uspace/lib/c/generic/malloc.c struct heap_area *prev;
prev 310 uspace/lib/c/generic/malloc.c area->prev = NULL;
prev 323 uspace/lib/c/generic/malloc.c area->prev = last_heap_area;
prev 424 uspace/lib/c/generic/malloc.c heap_area_t *prev = area->prev;
prev 427 uspace/lib/c/generic/malloc.c if (prev != NULL) {
prev 428 uspace/lib/c/generic/malloc.c area_check(prev);
prev 429 uspace/lib/c/generic/malloc.c prev->next = next;
prev 435 uspace/lib/c/generic/malloc.c next->prev = prev;
prev 437 uspace/lib/c/generic/malloc.c last_heap_area = prev;
prev 220 uspace/lib/c/test/adt/odict.c int prev;
prev 243 uspace/lib/c/test/adt/odict.c prev = -1;
prev 247 uspace/lib/c/test/adt/odict.c PCUT_ASSERT_EQUALS(true, e->key > prev);
prev 249 uspace/lib/c/test/adt/odict.c prev = e->key;
prev 83 uspace/lib/c/test/gsort.c int prev = data[0];
prev 85 uspace/lib/c/test/gsort.c PCUT_ASSERT_TRUE(prev <= data[i]);
prev 86 uspace/lib/c/test/gsort.c prev = data[i];
prev 426 uspace/lib/cpp/include/__bits/adt/hash_table.hpp current->prev = current;
prev 345 uspace/lib/cpp/include/__bits/adt/hash_table_policies.hpp tmp->prev = tmp;
prev 110 uspace/lib/cpp/include/__bits/adt/list.hpp current_ = current_->prev;
prev 156 uspace/lib/cpp/include/__bits/adt/list.hpp tmp = tmp->prev;
prev 240 uspace/lib/cpp/include/__bits/adt/list.hpp current_ = current_->prev;
prev 286 uspace/lib/cpp/include/__bits/adt/list.hpp tmp = tmp->prev;
prev 607 uspace/lib/cpp/include/__bits/adt/list.hpp return head_->prev->value;
prev 613 uspace/lib/cpp/include/__bits/adt/list.hpp return head_->prev->value;
prev 645 uspace/lib/cpp/include/__bits/adt/list.hpp head_->prev->next = head_->next;
prev 646 uspace/lib/cpp/include/__bits/adt/list.hpp head_->next->prev = head_->prev;
prev 685 uspace/lib/cpp/include/__bits/adt/list.hpp auto target = head_->prev;
prev 695 uspace/lib/cpp/include/__bits/adt/list.hpp target->prev->next = target->next;
prev 696 uspace/lib/cpp/include/__bits/adt/list.hpp target->next->prev = target->prev;
prev 712 uspace/lib/cpp/include/__bits/adt/list.hpp head_ = head_->prev;
prev 714 uspace/lib/cpp/include/__bits/adt/list.hpp return iterator{node->prev, head_, false};
prev 739 uspace/lib/cpp/include/__bits/adt/list.hpp auto node = position.node()->prev;
prev 790 uspace/lib/cpp/include/__bits/adt/list.hpp auto last_node = last.node()->prev;
prev 791 uspace/lib/cpp/include/__bits/adt/list.hpp auto prev = first_node->prev;
prev 794 uspace/lib/cpp/include/__bits/adt/list.hpp first_node->prev = nullptr;
prev 796 uspace/lib/cpp/include/__bits/adt/list.hpp prev->next = next;
prev 797 uspace/lib/cpp/include/__bits/adt/list.hpp next->prev = prev;
prev 804 uspace/lib/cpp/include/__bits/adt/list.hpp head_->prev = prev;
prev 845 uspace/lib/cpp/include/__bits/adt/list.hpp auto prev = node->prev;
prev 848 uspace/lib/cpp/include/__bits/adt/list.hpp prev->next = other_first;
prev 849 uspace/lib/cpp/include/__bits/adt/list.hpp other_first->prev = prev;
prev 850 uspace/lib/cpp/include/__bits/adt/list.hpp node->prev = other_last;
prev 875 uspace/lib/cpp/include/__bits/adt/list.hpp target->prev->next = target->next;
prev 876 uspace/lib/cpp/include/__bits/adt/list.hpp target->next->prev = target->prev;
prev 879 uspace/lib/cpp/include/__bits/adt/list.hpp node->prev->next = target;
prev 880 uspace/lib/cpp/include/__bits/adt/list.hpp target->prev = node->prev;
prev 882 uspace/lib/cpp/include/__bits/adt/list.hpp node->prev = target;
prev 916 uspace/lib/cpp/include/__bits/adt/list.hpp other.head_->prev = first.node()->prev;
prev 917 uspace/lib/cpp/include/__bits/adt/list.hpp first.node()->prev->next = last.node();
prev 920 uspace/lib/cpp/include/__bits/adt/list.hpp last_node = last.node()->prev;
prev 924 uspace/lib/cpp/include/__bits/adt/list.hpp auto new_last = first.node()->prev;
prev 925 uspace/lib/cpp/include/__bits/adt/list.hpp auto old_last = other.head_->prev;
prev 926 uspace/lib/cpp/include/__bits/adt/list.hpp other.head_->prev = new_last;
prev 935 uspace/lib/cpp/include/__bits/adt/list.hpp last_node = last.node()->prev;
prev 937 uspace/lib/cpp/include/__bits/adt/list.hpp first_node->prev->next = last.node();
prev 938 uspace/lib/cpp/include/__bits/adt/list.hpp last.node()->prev = first_node->prev;
prev 944 uspace/lib/cpp/include/__bits/adt/list.hpp first_node->prev = last_node;
prev 950 uspace/lib/cpp/include/__bits/adt/list.hpp target->prev->next = first_node;
prev 951 uspace/lib/cpp/include/__bits/adt/list.hpp first_node->prev = target->prev;
prev 953 uspace/lib/cpp/include/__bits/adt/list.hpp target->prev = last_node;
prev 1107 uspace/lib/cpp/include/__bits/adt/list.hpp head_->prev->next = nullptr;
prev 1146 uspace/lib/cpp/include/__bits/adt/list.hpp head_ = head_->prev;
prev 1159 uspace/lib/cpp/include/__bits/adt/list.hpp return head_->prev;
prev 1188 uspace/lib/cpp/include/__bits/adt/list.hpp head_->next->prev = head_->prev;
prev 1189 uspace/lib/cpp/include/__bits/adt/list.hpp head_->prev->next = head_->next;
prev 39 uspace/lib/cpp/include/__bits/adt/list_node.hpp list_node* prev;
prev 44 uspace/lib/cpp/include/__bits/adt/list_node.hpp next{}, prev{}
prev 47 uspace/lib/cpp/include/__bits/adt/list_node.hpp prev = this;
prev 51 uspace/lib/cpp/include/__bits/adt/list_node.hpp : value{val}, next{}, prev{}
prev 54 uspace/lib/cpp/include/__bits/adt/list_node.hpp prev = this;
prev 58 uspace/lib/cpp/include/__bits/adt/list_node.hpp : value{forward<T>(val)}, next{}, prev{}
prev 61 uspace/lib/cpp/include/__bits/adt/list_node.hpp prev = this;
prev 70 uspace/lib/cpp/include/__bits/adt/list_node.hpp node->prev = this;
prev 71 uspace/lib/cpp/include/__bits/adt/list_node.hpp next->prev = node;
prev 81 uspace/lib/cpp/include/__bits/adt/list_node.hpp node->prev = prev;
prev 82 uspace/lib/cpp/include/__bits/adt/list_node.hpp prev->next = node;
prev 83 uspace/lib/cpp/include/__bits/adt/list_node.hpp prev = node;
prev 88 uspace/lib/cpp/include/__bits/adt/list_node.hpp prev->next = next;
prev 89 uspace/lib/cpp/include/__bits/adt/list_node.hpp next->prev = prev;
prev 91 uspace/lib/cpp/include/__bits/adt/list_node.hpp prev = this;
prev 562 uspace/lib/label/src/mbr.c label_part_t *prev;
prev 673 uspace/lib/label/src/mbr.c prev = mbr_log_part_prev(part);
prev 674 uspace/lib/label/src/mbr.c if (prev != NULL) {
prev 676 uspace/lib/label/src/mbr.c rc = mbr_ebr_update_next(label, prev);
prev 709 uspace/lib/label/src/mbr.c label_part_t *prev;
prev 733 uspace/lib/label/src/mbr.c prev = mbr_log_part_prev(part);
prev 734 uspace/lib/label/src/mbr.c if (prev != NULL) {
prev 738 uspace/lib/label/src/mbr.c rc = mbr_ebr_update_next(part->label, prev);
prev 741 uspace/lib/label/src/mbr.c list_insert_after(&part->llog, &prev->llog);
prev 82 uspace/lib/posix/include/common/adt/list.h .prev = &(name).head, \
prev 98 uspace/lib/posix/include/common/adt/list.h for (link_t *_link = (list).head.prev; \
prev 100 uspace/lib/posix/include/common/adt/list.h _link != &(list).head; _link = _link->prev)
prev 146 uspace/lib/posix/include/common/adt/list.h struct __adt_list_link *prev; /**< Pointer to the previous item in the list. */
prev 162 uspace/lib/posix/include/common/adt/list.h return link->prev != NULL && link->next != NULL;
prev 174 uspace/lib/posix/include/common/adt/list.h link->prev = NULL;
prev 187 uspace/lib/posix/include/common/adt/list.h list->head.prev = &list->head;
prev 197 uspace/lib/posix/include/common/adt/list.h lnew->prev = lold->prev;
prev 198 uspace/lib/posix/include/common/adt/list.h lold->prev->next = lnew;
prev 199 uspace/lib/posix/include/common/adt/list.h lold->prev = lnew;
prev 207 uspace/lib/posix/include/common/adt/list.h lnew->prev = lold;
prev 209 uspace/lib/posix/include/common/adt/list.h lold->next->prev = lnew;
prev 249 uspace/lib/posix/include/common/adt/list.h if ((link->prev != NULL) && (link->next != NULL)) {
prev 250 uspace/lib/posix/include/common/adt/list.h link->next->prev = link->prev;
prev 251 uspace/lib/posix/include/common/adt/list.h link->prev->next = link->next;
prev 292 uspace/lib/posix/include/common/adt/list.h return (list->head.prev == &list->head) ? NULL : list->head.prev;
prev 316 uspace/lib/posix/include/common/adt/list.h return (link->prev == &list->head) ? NULL : link->prev;
prev 337 uspace/lib/posix/include/common/adt/list.h part1->prev->next = part2;
prev 338 uspace/lib/posix/include/common/adt/list.h part2->prev->next = part1;
prev 340 uspace/lib/posix/include/common/adt/list.h link_t *hlp = part1->prev;
prev 342 uspace/lib/posix/include/common/adt/list.h part1->prev = part2->prev;
prev 343 uspace/lib/posix/include/common/adt/list.h part2->prev = hlp;
prev 407 uspace/lib/posix/include/common/adt/list.h list_splice(list2, list1->head.prev);
prev 451 uspace/lib/posix/include/common/adt/list.h if (link->prev == NULL && link->next == NULL)
prev 454 uspace/lib/posix/include/common/adt/list.h assert(link->prev != NULL && link->next != NULL);
prev 594 uspace/lib/tbarcfg/src/tbarcfg.c smenu_entry_t *prev;
prev 596 uspace/lib/tbarcfg/src/tbarcfg.c prev = tbarcfg_smenu_prev(entry);
prev 597 uspace/lib/tbarcfg/src/tbarcfg.c if (prev == NULL) {
prev 603 uspace/lib/tbarcfg/src/tbarcfg.c list_insert_before(&entry->lentries, &prev->lentries);
prev 720 uspace/lib/ui/src/list.c ui_list_entry_t *prev;
prev 722 uspace/lib/ui/src/list.c prev = ui_list_prev(entry);
prev 723 uspace/lib/ui/src/list.c if (prev == NULL) {
prev 729 uspace/lib/ui/src/list.c list_insert_before(&entry->lentries, &prev->lentries);
prev 733 uspace/lib/ui/src/list.c list->page = prev;
prev 734 uspace/lib/ui/src/list.c } else if (list->page == prev) {
prev 744 uspace/lib/ui/src/list.c list->cursor = prev;
prev 746 uspace/lib/ui/src/list.c } else if (list->cursor == prev) {
prev 748 uspace/lib/ui/src/list.c ui_list_cursor_move(list, prev, list->cursor_idx + 1);
prev 1125 uspace/lib/ui/src/list.c ui_list_entry_t *prev;
prev 1128 uspace/lib/ui/src/list.c prev = ui_list_prev(list->cursor);
prev 1130 uspace/lib/ui/src/list.c if (prev != NULL)
prev 1131 uspace/lib/ui/src/list.c ui_list_cursor_move(list, prev, prev_idx);
prev 1285 uspace/lib/ui/src/list.c ui_list_entry_t *prev;
prev 1290 uspace/lib/ui/src/list.c prev = ui_list_prev(list->page);
prev 1291 uspace/lib/ui/src/list.c if (prev == NULL)
prev 1294 uspace/lib/ui/src/list.c list->page = prev;
prev 1344 uspace/lib/ui/src/list.c ui_list_entry_t *prev;
prev 1348 uspace/lib/ui/src/list.c prev = ui_list_prev(list->page);
prev 1349 uspace/lib/ui/src/list.c if (prev == NULL)
prev 1354 uspace/lib/ui/src/list.c for (i = 0; i < rows && prev != NULL; i++) {
prev 1355 uspace/lib/ui/src/list.c list->page = prev;
prev 1358 uspace/lib/ui/src/list.c prev = ui_list_prev(prev);
prev 1517 uspace/lib/ui/src/list.c ui_list_entry_t *prev;
prev 1534 uspace/lib/ui/src/list.c prev = ui_list_prev(list->page);
prev 1535 uspace/lib/ui/src/list.c if (prev == NULL)
prev 1538 uspace/lib/ui/src/list.c list->page = prev;
prev 1549 uspace/lib/ui/src/list.c prev = ui_list_prev(list->page);
prev 1550 uspace/lib/ui/src/list.c if (prev == NULL)
prev 1553 uspace/lib/ui/src/list.c list->page = prev;
prev 118 uspace/lib/ui/src/tab.c ui_tab_t *prev;
prev 130 uspace/lib/ui/src/tab.c prev = ui_tab_last(tabset);
prev 131 uspace/lib/ui/src/tab.c if (prev != NULL)
prev 132 uspace/lib/ui/src/tab.c tab->xoff = prev->xoff + ui_tab_handle_width(prev);
prev 912 uspace/lib/ui/test/filelist.c PCUT_TEST(prev)
prev 1660 uspace/lib/ui/test/list.c PCUT_TEST(prev)
prev 479 uspace/lib/usbhid/src/hiddescriptor.c report_item->usage_path->cpath_link.prev,
prev 289 uspace/lib/usbhid/src/hidpath.c report_link = report_path->items.head.prev;
prev 290 uspace/lib/usbhid/src/hidpath.c path_link = path->items.head.prev;
prev 310 uspace/lib/usbhid/src/hidpath.c report_link = report_link->prev;
prev 311 uspace/lib/usbhid/src/hidpath.c path_link = path_link->prev;
prev 291 uspace/srv/fs/exfat/exfat_idx.c if (lnk->prev != &u->freed_list.head)
prev 292 uspace/srv/fs/exfat/exfat_idx.c try_coalesce_intervals(lnk->prev, lnk,
prev 291 uspace/srv/fs/fat/fat_idx.c if (lnk->prev != &u->freed_list.head)
prev 292 uspace/srv/fs/fat/fat_idx.c try_coalesce_intervals(lnk->prev, lnk,
prev 65 uspace/srv/net/ethip/atrans.c ethip_atrans_t *prev;
prev 75 uspace/srv/net/ethip/atrans.c prev = atrans_find(ip_addr);
prev 76 uspace/srv/net/ethip/atrans.c if (prev != NULL) {
prev 77 uspace/srv/net/ethip/atrans.c list_remove(&prev->atrans_list);
prev 78 uspace/srv/net/ethip/atrans.c free(prev);
prev 80 uspace/srv/net/inetsrv/ntrans.c inet_ntrans_t *prev;
prev 90 uspace/srv/net/inetsrv/ntrans.c prev = ntrans_find(ip_addr);
prev 91 uspace/srv/net/inetsrv/ntrans.c if (prev != NULL) {
prev 92 uspace/srv/net/inetsrv/ntrans.c list_remove(&prev->ntrans_list);
prev 93 uspace/srv/net/inetsrv/ntrans.c free(prev);
prev 240 uspace/srv/net/inetsrv/reass.c reass_frag_t *frag, *prev;
prev 256 uspace/srv/net/inetsrv/reass.c prev = frag;
prev 265 uspace/srv/net/inetsrv/reass.c if (frag->packet.offs > prev->packet.offs + prev->packet.size)
prev 272 uspace/srv/net/inetsrv/reass.c prev = frag;
HelenOS homepage, sources at GitHub