next               41 bsp/drv/lib/queue.c 	item->next = head;
next               43 bsp/drv/lib/queue.c 	item->prev->next = item;
next               55 bsp/drv/lib/queue.c 	if (head->next == head)
next               57 bsp/drv/lib/queue.c 	item = head->next;
next               58 bsp/drv/lib/queue.c 	item->next->prev = head;
next               59 bsp/drv/lib/queue.c 	head->next = item->next;
next               70 bsp/drv/lib/queue.c 	item->next = prev->next;
next               71 bsp/drv/lib/queue.c 	prev->next->prev = item;
next               72 bsp/drv/lib/queue.c 	prev->next = item;
next               81 bsp/drv/lib/queue.c 	item->prev->next = item->next;
next               82 bsp/drv/lib/queue.c 	item->next->prev = item->prev;
next              133 bsp/hal/arm/arch/context.c context_switch(context_t prev, context_t next)
next              136 bsp/hal/arm/arch/context.c 	cpu_switch(&prev->kregs, &next->kregs);
next              139 bsp/hal/ppc/arch/context.c context_switch(context_t prev, context_t next)
next              142 bsp/hal/ppc/arch/context.c 	cpu_switch(&prev->kregs, &next->kregs);
next              145 bsp/hal/x86/arch/context.c context_switch(context_t prev, context_t next)
next              148 bsp/hal/x86/arch/context.c 	tss_set((uint32_t)next->esp0);
next              151 bsp/hal/x86/arch/context.c 	cpu_switch(&prev->kregs, &next->kregs);
next               36 include/sys/list.h 	struct list	*next;
next               42 include/sys/list.h #define list_init(head)		((head)->next = (head)->prev = (head))
next               43 include/sys/list.h #define list_next(node)		((node)->next)
next               45 include/sys/list.h #define list_empty(head)	((head)->next == (head))
next               46 include/sys/list.h #define list_first(head)	((head)->next)
next               65 include/sys/list.h 	prev->next->prev = node;
next               66 include/sys/list.h 	node->next = prev->next;
next               68 include/sys/list.h 	prev->next = node;
next               77 include/sys/list.h 	node->prev->next = node->next;
next               78 include/sys/list.h 	node->next->prev = node->prev;
next               36 include/sys/queue.h 	struct queue   *next;
next               41 include/sys/queue.h #define queue_init(head)	((head)->next = (head)->prev = (head))
next               42 include/sys/queue.h #define queue_empty(head)	((head)->next == (head))
next               43 include/sys/queue.h #define queue_next(q)		((q)->next)
next               45 include/sys/queue.h #define queue_first(head)	((head)->next)
next               41 sys/include/device.h 	struct device	*next;		/* linkage on list of all devices */
next               39 sys/include/sync.h 	struct sem	*next;		/* linkage on semaphore list in system */
next               43 sys/include/vm.h 	struct seg	*next;
next              166 sys/kern/device.c 	dev->next = device_list;
next              201 sys/kern/device.c 	for (dev = device_list; dev != NULL; dev = dev->next) {
next              229 sys/kern/device.c 	for (tmp = device_list; tmp != NULL; tmp = tmp->next) {
next              278 sys/kern/device.c 	for (tmp = &device_list; *tmp; tmp = &(*tmp)->next) {
next              280 sys/kern/device.c 			*tmp = dev->next;
next              488 sys/kern/device.c 	for (dev = device_list; dev != NULL; dev = dev->next) {
next              525 sys/kern/device.c 	for (dev = device_list; dev != NULL; dev = dev->next) {
next              217 sys/kern/sched.c 	thread_t prev, next;
next              235 sys/kern/sched.c 	next = runq_dequeue();
next              236 sys/kern/sched.c 	if (next == prev)
next              238 sys/kern/sched.c 	curthread = next;
next              244 sys/kern/sched.c 	if (prev->task != next->task)
next              245 sys/kern/sched.c 		vm_switch(next->task->map);
next              246 sys/kern/sched.c 	context_switch(&prev->ctx, &next->ctx);
next               43 sys/lib/queue.c 	item->next = head;
next               45 sys/lib/queue.c 	item->prev->next = item;
next               57 sys/lib/queue.c 	if (head->next == head)
next               59 sys/lib/queue.c 	item = head->next;
next               60 sys/lib/queue.c 	item->next->prev = head;
next               61 sys/lib/queue.c 	head->next = item->next;
next               73 sys/lib/queue.c 	item->next = prev->next;
next               74 sys/lib/queue.c 	prev->next->prev = item;
next               75 sys/lib/queue.c 	prev->next = item;
next               85 sys/lib/queue.c 	item->prev->next = item->next;
next               86 sys/lib/queue.c 	item->next->prev = item->prev;
next               57 sys/mem/page.c 	struct page	*next;
next               91 sys/mem/page.c 		blk = blk->next;
next              106 sys/mem/page.c 		blk->prev->next = blk->next;
next              107 sys/mem/page.c 		blk->next->prev = blk->prev;
next              112 sys/mem/page.c 		tmp->next = blk->next;
next              113 sys/mem/page.c 		blk->prev->next = tmp;
next              114 sys/mem/page.c 		blk->next->prev = tmp;
next              144 sys/mem/page.c 	for (prev = &page_head; prev->next < blk; prev = prev->next) {
next              145 sys/mem/page.c 		if (prev->next == &page_head)
next              154 sys/mem/page.c 	blk->next = prev->next;
next              155 sys/mem/page.c 	prev->next->prev = blk;
next              156 sys/mem/page.c 	prev->next = blk;
next              162 sys/mem/page.c 	if (blk->next != &page_head &&
next              163 sys/mem/page.c 	    ((vaddr_t)blk + blk->size) == (vaddr_t)blk->next) {
next              164 sys/mem/page.c 		blk->size += blk->next->size;
next              165 sys/mem/page.c 		blk->next = blk->next->next;
next              166 sys/mem/page.c 		blk->next->prev = blk;
next              171 sys/mem/page.c 		blk->prev->next = blk->next;
next              172 sys/mem/page.c 		blk->next->prev = blk->prev;
next              198 sys/mem/page.c 	blk = page_head.next;
next              206 sys/mem/page.c 		blk = blk->next;
next              212 sys/mem/page.c 		blk->prev->next = blk->next;
next              213 sys/mem/page.c 		blk->next->prev = blk->prev;
next              221 sys/mem/page.c 			tmp->next = blk->next;
next              225 sys/mem/page.c 			blk->next->prev = tmp;
next              226 sys/mem/page.c 			blk->next = tmp;
next              229 sys/mem/page.c 			blk->prev->next = blk->next;
next              230 sys/mem/page.c 			blk->next->prev = blk->prev;
next              270 sys/mem/page.c 	page_head.next = page_head.prev = &page_head;
next              505 sys/mem/vm.c   		seg = seg->next;
next              565 sys/mem/vm.c   	tmp->next = tmp->prev = tmp;
next              567 sys/mem/vm.c   	if (src == src->next)	/* Blank memory ? */
next              572 sys/mem/vm.c   		ASSERT(src->next != NULL);
next              585 sys/mem/vm.c   			dest->next = tmp->next;
next              586 sys/mem/vm.c   			tmp->next->prev = dest;
next              587 sys/mem/vm.c   			tmp->next = dest;
next              621 sys/mem/vm.c   		src = src->next;
next              637 sys/mem/vm.c   		dest = dest->next;
next              638 sys/mem/vm.c   		src = src->next;
next              766 sys/mem/vm.c   		seg = seg->next;
next              797 sys/mem/vm.c   	seg->next = seg->prev = seg;
next              823 sys/mem/vm.c   	seg->next = prev->next;
next              825 sys/mem/vm.c   	prev->next->prev = seg;
next              826 sys/mem/vm.c   	prev->next = seg;
next              865 sys/mem/vm.c   		seg = seg->next;
next              893 sys/mem/vm.c   		seg = seg->next;
next              904 sys/mem/vm.c   	struct seg *prev, *next;
next              922 sys/mem/vm.c   	next = seg->next;
next              923 sys/mem/vm.c   	if (next != head && (next->flags & SEG_FREE)) {
next              924 sys/mem/vm.c   		seg->next = next->next;
next              925 sys/mem/vm.c   		next->next->prev = seg;
next              926 sys/mem/vm.c   		seg->size += next->size;
next              927 sys/mem/vm.c   		kmem_free(next);
next              934 sys/mem/vm.c   		prev->next = seg->next;
next              935 sys/mem/vm.c   		seg->next->prev = prev;
next              947 sys/mem/vm.c   	struct seg *seg, *prev, *next;
next              973 sys/mem/vm.c   		next = seg_create(seg, seg->addr + size, seg->size - size);
next              974 sys/mem/vm.c   		if (next == NULL) {
next              407 sys/mem/vm_nommu.c 		seg = seg->next;
next              526 sys/mem/vm_nommu.c 		seg = seg->next;
next              547 sys/mem/vm_nommu.c 	seg->next = seg->prev = seg;
next              573 sys/mem/vm_nommu.c 	seg->next = prev->next;
next              575 sys/mem/vm_nommu.c 	prev->next->prev = seg;
next              576 sys/mem/vm_nommu.c 	prev->next = seg;
next              615 sys/mem/vm_nommu.c 		seg = seg->next;
next              656 sys/mem/vm_nommu.c 	seg->prev->next = seg->next;
next              657 sys/mem/vm_nommu.c 	seg->next->prev = seg->prev;
next              114 sys/sync/sem.c 		s->next = sem_list;
next              296 sys/sync/sem.c 	for (sp = &sem_list; *sp; sp = &(*sp)->next) {
next              298 sys/sync/sem.c 			*sp = s->next;
next              323 sys/sync/sem.c 	for (tmp = sem_list; tmp; tmp = tmp->next) {
next               99 usr/include/stdio.h 	struct __sFILE *next;	/* file chain */
next              347 usr/lib/libc/gen/fts.c next:	tmp = p;
next              370 usr/lib/libc/gen/fts.c 			goto next;
next               45 usr/lib/libc/stdio/findfp.c std(FILE *fp, FILE *next, short flags, short fileno)
next               49 usr/lib/libc/stdio/findfp.c 	fp->next = next;
next               64 usr/lib/libc/stdio/findfp.c 	for (fp = &__sF[0];; fp = fp->next) {
next               67 usr/lib/libc/stdio/findfp.c 		if (fp->next == NULL) {
next               70 usr/lib/libc/stdio/findfp.c 			fp->next = tmp;
next               45 usr/lib/libc/stdio/fwalk.c 	for (fp = &__sF[0]; fp != NULL; fp = fp->next) {
next               33 usr/lib/libc/stdlib/rand.c static u_long next = 1;
next               38 usr/lib/libc/stdlib/rand.c 	return ((next = next * 1103515245 + 12345) % ((u_long)RAND_MAX + 1));
next               45 usr/lib/libc/stdlib/rand.c 	next = seed;
next               64 usr/lib/prex/malloc/malloc.c 		free_list.next = &free_list;
next               70 usr/lib/prex/malloc/malloc.c 	for (p = prev->next;; prev = p, p = p->next) {
next               73 usr/lib/prex/malloc/malloc.c 				prev->next = p->next;
next              116 usr/lib/prex/malloc/malloc.c 	for (prev = scan_head; !(p > prev && p < prev->next); prev = prev->next) {
next              117 usr/lib/prex/malloc/malloc.c 		if (prev >= prev->next && (p > prev || p < prev->next))
next              120 usr/lib/prex/malloc/malloc.c 	p->next = prev->next;
next              121 usr/lib/prex/malloc/malloc.c 	prev->next = p;
next              141 usr/lib/prex/malloc/malloc.c 	for (prev = scan_head; !(p > prev && p < prev->next); prev = prev->next) {
next              142 usr/lib/prex/malloc/malloc.c 		if (prev >= prev->next && (p > prev || p < prev->next))
next              145 usr/lib/prex/malloc/malloc.c 	if ((prev->next->vm_size == 0) &&	/* join to upper block */
next              146 usr/lib/prex/malloc/malloc.c 	    ((char *)p + p->size == (char *)prev->next)) {
next              147 usr/lib/prex/malloc/malloc.c 		p->size += prev->next->size;
next              148 usr/lib/prex/malloc/malloc.c 		p->next = prev->next->next;
next              150 usr/lib/prex/malloc/malloc.c 		p->next = prev->next;
next              155 usr/lib/prex/malloc/malloc.c 		prev->next = p->next;
next              157 usr/lib/prex/malloc/malloc.c 		prev->next = p;
next              161 usr/lib/prex/malloc/malloc.c 		prev->next = p->next;
next              175 usr/lib/prex/malloc/malloc.c 	for (p = free_list.next; p != &free_list; p = p->next) {
next              176 usr/lib/prex/malloc/malloc.c 		printf("mstat: addr=%x size=%d next=%x\n", p, p->size, p->next);
next               50 usr/lib/prex/malloc/malloc.h 	struct header *next;
next              199 usr/server/fs/fatfs/fatfs.h int	 fat_next_cluster(struct fatfsmount *fmp, u_long cl, u_long *next);
next              200 usr/server/fs/fatfs/fatfs.h int	 fat_set_cluster(struct fatfsmount *fmp, u_long cl, u_long next);
next              128 usr/server/fs/fatfs/fatfs_fat.c fat_next_cluster(struct fatfsmount *fmp, u_long cl, u_long *next)
next              155 usr/server/fs/fatfs/fatfs_fat.c 	*next = (u_long)val;
next              156 usr/server/fs/fatfs/fatfs_fat.c 	DPRINTF(("fat_next_cluster: %d => %d\n", cl, *next));
next              167 usr/server/fs/fatfs/fatfs_fat.c fat_set_cluster(struct fatfsmount *fmp, u_long cl, u_long next)
next              186 usr/server/fs/fatfs/fatfs_fat.c 	val = (uint16_t)(next & fmp->fat_mask);
next              214 usr/server/fs/fatfs/fatfs_fat.c 	u_long cl, next;
next              224 usr/server/fs/fatfs/fatfs_fat.c 		error = fat_next_cluster(fmp, cl, &next);
next              227 usr/server/fs/fatfs/fatfs_fat.c 		if (next == CL_FREE) {	/* free ? */
next              247 usr/server/fs/fatfs/fatfs_fat.c 	u_long cl, next;
next              254 usr/server/fs/fatfs/fatfs_fat.c 		error = fat_next_cluster(fmp, cl, &next);
next              260 usr/server/fs/fatfs/fatfs_fat.c 		cl = next;
next              311 usr/server/fs/fatfs/fatfs_fat.c 	u_long next;
next              317 usr/server/fs/fatfs/fatfs_fat.c 		error = fat_next_cluster(fmp, cl, &next);
next              320 usr/server/fs/fatfs/fatfs_fat.c 		if (alloc || next >= fmp->fat_eof) {
next              321 usr/server/fs/fatfs/fatfs_fat.c 			error = fat_alloc_cluster(fmp, cl, &next);
next              327 usr/server/fs/fatfs/fatfs_fat.c 			error = fat_set_cluster(fmp, cl, next);
next              331 usr/server/fs/fatfs/fatfs_fat.c 		cl = next;
next              352 usr/server/fs/fatfs/fatfs_fat.c 	u_long next;
next              356 usr/server/fs/fatfs/fatfs_fat.c 		error = fat_next_cluster(fmp, cl, &next);
next              359 usr/server/fs/fatfs/fatfs_fat.c 		cl = next;
next              362 usr/server/fs/fatfs/fatfs_fat.c 	error = fat_alloc_cluster(fmp, cl, &next);
next              366 usr/server/fs/fatfs/fatfs_fat.c 	error = fat_set_cluster(fmp, cl, next);
next              370 usr/server/fs/fatfs/fatfs_fat.c 	error = fat_set_cluster(fmp, next, fmp->fat_eof);
next              374 usr/server/fs/fatfs/fatfs_fat.c 	*new_cl = next;
next              297 usr/server/fs/fatfs/fatfs_node.c 	u_long next;
next              321 usr/server/fs/fatfs/fatfs_node.c 			error = fat_next_cluster(fmp, cl, &next);
next              324 usr/server/fs/fatfs/fatfs_node.c 			cl = next;
next              328 usr/server/fs/fatfs/fatfs_node.c 		error = fat_expand_dir(fmp, cl, &next);
next              334 usr/server/fs/fatfs/fatfs_node.c 		sec = cl_to_sec(fmp, next);
next              342 usr/server/fs/fatfs/fatfs_node.c 		sec = cl_to_sec(fmp, next);