next               45 kernel/bio.c     bcache.head.next = &bcache.head;
next               47 kernel/bio.c       b->next = bcache.head.next;
next               50 kernel/bio.c       bcache.head.next->prev = b;
next               51 kernel/bio.c       bcache.head.next = b;
next               66 kernel/bio.c     for(b = bcache.head.next; b != &bcache.head; b = b->next){
next              128 kernel/bio.c       b->next->prev = b->prev;
next              129 kernel/bio.c       b->prev->next = b->next;
next              130 kernel/bio.c       b->next = bcache.head.next;
next              132 kernel/bio.c       bcache.head.next->prev = b;
next              133 kernel/bio.c       bcache.head.next = b;
next                9 kernel/buf.h     struct buf *next;
next              654 kernel/fs.c      struct inode *ip, *next;
next              672 kernel/fs.c        if((next = dirlookup(ip, name, 0)) == 0){
next              677 kernel/fs.c        ip = next;
next               18 kernel/kalloc.c   struct run *next;
next               60 kernel/kalloc.c   r->next = kmem.freelist;
next               76 kernel/kalloc.c     kmem.freelist = r->next;
next               57 kernel/virtio.h   uint16 next;
next              179 kernel/virtio_disk.c   disk.desc[i].next = 0;
next              190 kernel/virtio_disk.c     int nxt = disk.desc[i].next;
next              250 kernel/virtio_disk.c   disk.desc[idx[0]].next = idx[1];
next              259 kernel/virtio_disk.c   disk.desc[idx[1]].next = idx[2];
next              265 kernel/virtio_disk.c   disk.desc[idx[2]].next = 0;