prev 42 bsp/drv/lib/queue.c item->prev = head->prev;
prev 43 bsp/drv/lib/queue.c item->prev->next = item;
prev 44 bsp/drv/lib/queue.c head->prev = item;
prev 58 bsp/drv/lib/queue.c item->next->prev = head;
prev 67 bsp/drv/lib/queue.c queue_insert(queue_t prev, queue_t item)
prev 69 bsp/drv/lib/queue.c item->prev = prev;
prev 70 bsp/drv/lib/queue.c item->next = prev->next;
prev 71 bsp/drv/lib/queue.c prev->next->prev = item;
prev 72 bsp/drv/lib/queue.c prev->next = item;
prev 81 bsp/drv/lib/queue.c item->prev->next = item->next;
prev 82 bsp/drv/lib/queue.c item->next->prev = item->prev;
prev 133 bsp/hal/arm/arch/context.c context_switch(context_t prev, context_t next)
prev 136 bsp/hal/arm/arch/context.c cpu_switch(&prev->kregs, &next->kregs);
prev 139 bsp/hal/ppc/arch/context.c context_switch(context_t prev, context_t next)
prev 142 bsp/hal/ppc/arch/context.c cpu_switch(&prev->kregs, &next->kregs);
prev 145 bsp/hal/x86/arch/context.c context_switch(context_t prev, context_t next)
prev 151 bsp/hal/x86/arch/context.c cpu_switch(&prev->kregs, &next->kregs);
prev 37 include/sys/list.h struct list *prev;
prev 42 include/sys/list.h #define list_init(head) ((head)->next = (head)->prev = (head))
prev 44 include/sys/list.h #define list_prev(node) ((node)->prev)
prev 47 include/sys/list.h #define list_last(head) ((head)->prev)
prev 63 include/sys/list.h list_insert(list_t prev, list_t node)
prev 65 include/sys/list.h prev->next->prev = node;
prev 66 include/sys/list.h node->next = prev->next;
prev 67 include/sys/list.h node->prev = prev;
prev 68 include/sys/list.h prev->next = node;
prev 77 include/sys/list.h node->prev->next = node->next;
prev 78 include/sys/list.h node->next->prev = node->prev;
prev 37 include/sys/queue.h struct queue *prev;
prev 41 include/sys/queue.h #define queue_init(head) ((head)->next = (head)->prev = (head))
prev 44 include/sys/queue.h #define queue_prev(q) ((q)->prev)
prev 46 include/sys/queue.h #define queue_last(head) ((head)->prev)
prev 42 sys/include/vm.h struct seg *prev; /* segment list sorted by address */
prev 217 sys/kern/sched.c thread_t prev, next;
prev 222 sys/kern/sched.c prev = curthread;
prev 223 sys/kern/sched.c if (prev->state == TS_RUN) {
prev 224 sys/kern/sched.c if (prev->priority > maxpri)
prev 225 sys/kern/sched.c runq_insert(prev); /* preemption */
prev 227 sys/kern/sched.c runq_enqueue(prev);
prev 229 sys/kern/sched.c prev->resched = 0;
prev 236 sys/kern/sched.c if (next == prev)
prev 244 sys/kern/sched.c if (prev->task != next->task)
prev 246 sys/kern/sched.c context_switch(&prev->ctx, &next->ctx);
prev 44 sys/lib/queue.c item->prev = head->prev;
prev 45 sys/lib/queue.c item->prev->next = item;
prev 46 sys/lib/queue.c head->prev = item;
prev 60 sys/lib/queue.c item->next->prev = head;
prev 69 sys/lib/queue.c queue_insert(queue_t prev, queue_t item)
prev 72 sys/lib/queue.c item->prev = prev;
prev 73 sys/lib/queue.c item->next = prev->next;
prev 74 sys/lib/queue.c prev->next->prev = item;
prev 75 sys/lib/queue.c prev->next = item;
prev 85 sys/lib/queue.c item->prev->next = item->next;
prev 86 sys/lib/queue.c item->next->prev = item->prev;
prev 58 sys/mem/page.c struct page *prev;
prev 106 sys/mem/page.c blk->prev->next = blk->next;
prev 107 sys/mem/page.c blk->next->prev = blk->prev;
prev 111 sys/mem/page.c tmp->prev = blk->prev;
prev 113 sys/mem/page.c blk->prev->next = tmp;
prev 114 sys/mem/page.c blk->next->prev = tmp;
prev 131 sys/mem/page.c struct page *blk, *prev;
prev 144 sys/mem/page.c for (prev = &page_head; prev->next < blk; prev = prev->next) {
prev 145 sys/mem/page.c if (prev->next == &page_head)
prev 153 sys/mem/page.c blk->prev = prev;
prev 154 sys/mem/page.c blk->next = prev->next;
prev 155 sys/mem/page.c prev->next->prev = blk;
prev 156 sys/mem/page.c prev->next = blk;
prev 166 sys/mem/page.c blk->next->prev = blk;
prev 168 sys/mem/page.c if (blk->prev != &page_head &&
prev 169 sys/mem/page.c (vaddr_t)blk->prev + blk->prev->size == (vaddr_t)blk) {
prev 170 sys/mem/page.c blk->prev->size += blk->size;
prev 171 sys/mem/page.c blk->prev->next = blk->next;
prev 172 sys/mem/page.c blk->next->prev = blk->prev;
prev 212 sys/mem/page.c blk->prev->next = blk->next;
prev 213 sys/mem/page.c blk->next->prev = blk->prev;
prev 222 sys/mem/page.c tmp->prev = blk;
prev 225 sys/mem/page.c blk->next->prev = tmp;
prev 229 sys/mem/page.c blk->prev->next = blk->next;
prev 230 sys/mem/page.c blk->next->prev = blk->prev;
prev 270 sys/mem/page.c page_head.next = page_head.prev = &page_head;
prev 565 sys/mem/vm.c tmp->next = tmp->prev = tmp;
prev 584 sys/mem/vm.c dest->prev = tmp;
prev 586 sys/mem/vm.c tmp->next->prev = dest;
prev 797 sys/mem/vm.c seg->next = seg->prev = seg;
prev 810 sys/mem/vm.c seg_create(struct seg *prev, vaddr_t addr, size_t size)
prev 823 sys/mem/vm.c seg->next = prev->next;
prev 824 sys/mem/vm.c seg->prev = prev;
prev 825 sys/mem/vm.c prev->next->prev = seg;
prev 826 sys/mem/vm.c prev->next = seg;
prev 904 sys/mem/vm.c struct seg *prev, *next;
prev 925 sys/mem/vm.c next->next->prev = seg;
prev 932 sys/mem/vm.c prev = seg->prev;
prev 933 sys/mem/vm.c if (seg != head && (prev->flags & SEG_FREE)) {
prev 934 sys/mem/vm.c prev->next = seg->next;
prev 935 sys/mem/vm.c seg->next->prev = prev;
prev 936 sys/mem/vm.c prev->size += seg->size;
prev 947 sys/mem/vm.c struct seg *seg, *prev, *next;
prev 960 sys/mem/vm.c prev = NULL;
prev 962 sys/mem/vm.c prev = seg;
prev 964 sys/mem/vm.c seg = seg_create(prev, addr, prev->size - diff);
prev 967 sys/mem/vm.c prev->size = diff;
prev 975 sys/mem/vm.c if (prev) {
prev 547 sys/mem/vm_nommu.c seg->next = seg->prev = seg;
prev 560 sys/mem/vm_nommu.c seg_create(struct seg *prev, vaddr_t addr, size_t size)
prev 573 sys/mem/vm_nommu.c seg->next = prev->next;
prev 574 sys/mem/vm_nommu.c seg->prev = prev;
prev 575 sys/mem/vm_nommu.c prev->next->prev = seg;
prev 576 sys/mem/vm_nommu.c prev->next = seg;
prev 656 sys/mem/vm_nommu.c seg->prev->next = seg->next;
prev 657 sys/mem/vm_nommu.c seg->next->prev = seg->prev;
prev 54 usr/lib/prex/malloc/malloc.c struct header *p, *prev;
prev 69 usr/lib/prex/malloc/malloc.c prev = scan_head;
prev 70 usr/lib/prex/malloc/malloc.c for (p = prev->next;; prev = p, p = p->next) {
prev 73 usr/lib/prex/malloc/malloc.c prev->next = p->next;
prev 83 usr/lib/prex/malloc/malloc.c scan_head = prev;
prev 107 usr/lib/prex/malloc/malloc.c struct header *p, *prev;
prev 116 usr/lib/prex/malloc/malloc.c for (prev = scan_head; !(p > prev && p < prev->next); prev = prev->next) {
prev 117 usr/lib/prex/malloc/malloc.c if (prev >= prev->next && (p > prev || p < prev->next))
prev 120 usr/lib/prex/malloc/malloc.c p->next = prev->next;
prev 121 usr/lib/prex/malloc/malloc.c prev->next = p;
prev 122 usr/lib/prex/malloc/malloc.c scan_head = prev;
prev 123 usr/lib/prex/malloc/malloc.c return prev;
prev 129 usr/lib/prex/malloc/malloc.c struct header *p, *prev;
prev 141 usr/lib/prex/malloc/malloc.c for (prev = scan_head; !(p > prev && p < prev->next); prev = prev->next) {
prev 142 usr/lib/prex/malloc/malloc.c if (prev >= prev->next && (p > prev || p < prev->next))
prev 145 usr/lib/prex/malloc/malloc.c if ((prev->next->vm_size == 0) && /* join to upper block */
prev 146 usr/lib/prex/malloc/malloc.c ((char *)p + p->size == (char *)prev->next)) {
prev 147 usr/lib/prex/malloc/malloc.c p->size += prev->next->size;
prev 148 usr/lib/prex/malloc/malloc.c p->next = prev->next->next;
prev 150 usr/lib/prex/malloc/malloc.c p->next = prev->next;
prev 153 usr/lib/prex/malloc/malloc.c ((char *)prev + prev->size == (char *)p)) {
prev 154 usr/lib/prex/malloc/malloc.c prev->size += p->size;
prev 155 usr/lib/prex/malloc/malloc.c prev->next = p->next;
prev 157 usr/lib/prex/malloc/malloc.c prev->next = p;
prev 161 usr/lib/prex/malloc/malloc.c prev->next = p->next;
prev 164 usr/lib/prex/malloc/malloc.c scan_head = prev;
prev 130 usr/server/fs/ramfs/ramfs_vnops.c struct ramfs_node *np, *prev;
prev 142 usr/server/fs/ramfs/ramfs_vnops.c prev = dnp->rn_child;
prev 143 usr/server/fs/ramfs/ramfs_vnops.c while (prev->rn_next != NULL)
prev 144 usr/server/fs/ramfs/ramfs_vnops.c prev = prev->rn_next;
prev 145 usr/server/fs/ramfs/ramfs_vnops.c prev->rn_next = np;
prev 154 usr/server/fs/ramfs/ramfs_vnops.c struct ramfs_node *prev;
prev 165 usr/server/fs/ramfs/ramfs_vnops.c for (prev = dnp->rn_child; prev->rn_next != np;
prev 166 usr/server/fs/ramfs/ramfs_vnops.c prev = prev->rn_next) {
prev 167 usr/server/fs/ramfs/ramfs_vnops.c if (prev->rn_next == NULL) {
prev 172 usr/server/fs/ramfs/ramfs_vnops.c prev->rn_next = np->rn_next;