diff options
| author | David Greenman <dg@FreeBSD.org> | 1995-08-07 11:55:32 +0000 |
|---|---|---|
| committer | David Greenman <dg@FreeBSD.org> | 1995-08-07 11:55:32 +0000 |
| commit | 5d210d3fd4d4a87ac2065f8a6fc94b653be05762 (patch) | |
| tree | b20deb3e639a58389e2df80d3410e75a01ab0622 | |
| parent | b4224c9c6c7d89022dc90474ea6b5d89ea268103 (diff) | |
Notes
| -rw-r--r-- | sys/kern/subr_disklabel.c | 9 | ||||
| -rw-r--r-- | sys/ufs/ufs/ufs_disksubr.c | 9 |
2 files changed, 14 insertions, 4 deletions
diff --git a/sys/kern/subr_disklabel.c b/sys/kern/subr_disklabel.c index 958f5946e88b..c1d1f569d2cc 100644 --- a/sys/kern/subr_disklabel.c +++ b/sys/kern/subr_disklabel.c @@ -42,7 +42,7 @@ * SUCH DAMAGE. * * @(#)ufs_disksubr.c 8.5 (Berkeley) 1/21/94 - * $Id: ufs_disksubr.c,v 1.14 1995/03/18 07:06:51 davidg Exp $ + * $Id: ufs_disksubr.c,v 1.15 1995/05/30 08:15:33 rgrimes Exp $ */ #include <sys/param.h> @@ -80,11 +80,14 @@ disksort(ap, bp) register struct buf *ap, *bp; { register struct buf *bq; + int s; + s = splbio(); /* If the queue is empty, then it's easy. */ if (ap->b_actf == NULL) { bp->b_actf = NULL; ap->b_actf = bp; + splx(s); return; } @@ -142,8 +145,10 @@ disksort(ap, bp) * Neither a second list nor a larger request... we go at the end of * the first list, which is the same as the end of the whole schebang. */ -insert: bp->b_actf = bq->b_actf; +insert: + bp->b_actf = bq->b_actf; bq->b_actf = bp; + splx(s); } /* diff --git a/sys/ufs/ufs/ufs_disksubr.c b/sys/ufs/ufs/ufs_disksubr.c index 958f5946e88b..c1d1f569d2cc 100644 --- a/sys/ufs/ufs/ufs_disksubr.c +++ b/sys/ufs/ufs/ufs_disksubr.c @@ -42,7 +42,7 @@ * SUCH DAMAGE. * * @(#)ufs_disksubr.c 8.5 (Berkeley) 1/21/94 - * $Id: ufs_disksubr.c,v 1.14 1995/03/18 07:06:51 davidg Exp $ + * $Id: ufs_disksubr.c,v 1.15 1995/05/30 08:15:33 rgrimes Exp $ */ #include <sys/param.h> @@ -80,11 +80,14 @@ disksort(ap, bp) register struct buf *ap, *bp; { register struct buf *bq; + int s; + s = splbio(); /* If the queue is empty, then it's easy. */ if (ap->b_actf == NULL) { bp->b_actf = NULL; ap->b_actf = bp; + splx(s); return; } @@ -142,8 +145,10 @@ disksort(ap, bp) * Neither a second list nor a larger request... we go at the end of * the first list, which is the same as the end of the whole schebang. */ -insert: bp->b_actf = bq->b_actf; +insert: + bp->b_actf = bq->b_actf; bq->b_actf = bp; + splx(s); } /* |