next               49 bio.c            bcache.head.next = &bcache.head;
next               51 bio.c              b->next = bcache.head.next;
next               54 bio.c              bcache.head.next->prev = b;
next               55 bio.c              bcache.head.next = b;
next               71 bio.c            for(b = bcache.head.next; b != &bcache.head; b = b->next){
next              131 bio.c            b->next->prev = b->prev;
next              132 bio.c            b->prev->next = b->next;
next              133 bio.c            b->next = bcache.head.next;
next              135 bio.c            bcache.head.next->prev = b;
next              136 bio.c            bcache.head.next = b;
next                6 buf.h            struct buf *next;
next              608 fs.c             struct inode *ip, *next;
next              626 fs.c               if((next = dirlookup(ip, name, 0)) == 0){
next              631 fs.c               ip = next;
next               16 kalloc.c         struct run *next;
next               73 kalloc.c         r->next = kmem.freelist;
next               91 kalloc.c           kmem.freelist = r->next;