/src/games/backgammon/backgammon/ |
move.c | 57 struct BOARD *b_next; /* forward queue pointer */ member in struct:BOARD 281 qp->b_next = 0; 286 new->b_next = qp; 295 while (qp->b_next != 0) {/* traverse queue */ 296 result = bcomp(new, qp->b_next); 298 new->b_next = qp->b_next; 299 qp->b_next = new; 303 mvcheck(mm, qp->b_next, new); 307 qp = qp->b_next; [all...] |
/src/sbin/fsck_ext2fs/ |
utilities.c | 153 bufhead.b_next = bufhead.b_prev = &bufhead; 169 bp->b_next = bufhead.b_next; 170 bufhead.b_next->b_prev = bp; 171 bufhead.b_next = bp; 185 for (bp = bufhead.b_next; bp != &bufhead; bp = bp->b_next) 198 bp->b_prev->b_next = bp->b_next; 199 bp->b_next->b_prev = bp->b_prev [all...] |
fsck.h | 80 struct bufarea *b_next; /* free list queue */ member in struct:bufarea
|
/src/sbin/ifconfig/ |
extern.h | 69 SIMPLEQ_ENTRY(cmdloop_branch) b_next;
|
parse.c | 574 SIMPLEQ_FOREACH(b, &pb->pb_branches, b_next) { 750 SIMPLEQ_INSERT_HEAD(&pb->pb_branches, b, b_next); 764 SIMPLEQ_REMOVE_HEAD(&pb->pb_branches, b_next); 775 SIMPLEQ_INSERT_TAIL(&pb->pb_branches, b, b_next); 781 SIMPLEQ_REMOVE_HEAD(&pb->pb_branches, b_next); 801 SIMPLEQ_FOREACH(b, &pb->pb_branches, b_next) {
|
parse.h | 46 SIMPLEQ_ENTRY(branch) b_next;
|
ifconfig.c | 410 SIMPLEQ_INSERT_TAIL(&cmdloop_branches, b, b_next); 506 SIMPLEQ_FOREACH(b, &cmdloop_branches, b_next)
|
/src/games/hunt/huntd/ |
shots.c | 88 next = bp->b_next; 105 bp->b_next = Bullets; 112 bp->b_next = Bullets; 120 bp->b_next = Bullets; 126 bp->b_next = Bullets; 135 next = bp->b_next; 217 zapshot(bp->b_next, bp); 223 zapshot(bp->b_next, bp); 560 bp->b_next = Bullets; 992 for (bp = blist; bp != NULL; bp = bp->b_next) { [all...] |
hunt.h | 119 BULLET *b_next; member in struct:bullet_def
|
execute.c | 465 bp->b_next = Bullets; 492 bp->b_next = NULL;
|
driver.c | 701 for (bp = Bullets; bp != NULL; bp = bp->b_next) {
|
/src/sbin/fsck_ffs/ |
utilities.c | 150 bufhead.b_next = bufhead.b_prev = &bufhead; 169 bp->b_next = bufhead.b_next; 170 bufhead.b_next->b_prev = bp; 171 bufhead.b_next = bp; 185 for (bp = bufhead.b_next; bp != &bufhead; bp = bp->b_next) 196 bp->b_prev->b_next = bp->b_next; 197 bp->b_next->b_prev = bp->b_prev [all...] |
fsck.h | 108 struct bufarea *b_next; /* free list queue */ member in struct:bufarea
|
/src/usr.bin/rdist/ |
server.c | 203 bp->b_next = expand(makeblock(NAME, cp), E_VARS); 204 while (bp->b_next != NULL) 205 bp = bp->b_next;
|