- * Swap IO headers -
- * They contain the necessary information for the swap I/O.
- * At any given time, a swap header can be in three
- * different lists. When free it is in the free list,
- * when allocated and the I/O queued, it is on the swap
- * device list, and finally, if the operation was a dirty
- * page push, when the I/O completes, it is inserted
- * in a list of cleaned pages to be processed by the pageout daemon.
- */
-struct buf *swbuf;
-short *swsize; /* CAN WE JUST USE B_BCOUNT? */
-int *swpf;
-
-
-#ifndef UNFAST
-#define notavail(bp) \
-{ \
- int s = spl6(); \
- (bp)->av_back->av_forw = (bp)->av_forw; \
- (bp)->av_forw->av_back = (bp)->av_back; \
- (bp)->b_flags |= B_BUSY; \
- splx(s); \
-}
-#endif
-
-/*
- * Read in (if necessary) the block and return a buffer pointer.
- */
-struct buf *
-bread(dev, blkno)
-dev_t dev;
-daddr_t blkno;
-{
- register struct buf *bp;
-
- bp = getblk(dev, blkno);
- if (bp->b_flags&B_DONE) {
-#ifdef TRACE
- trace(TR_BREADHIT, dev, blkno);
-#endif
-#ifdef DISKMON
- io_info.ncache++;
-#endif
- return(bp);
- }
- bp->b_flags |= B_READ;
- bp->b_bcount = BSIZE;
- (*bdevsw[major(dev)].d_strategy)(bp);
-#ifdef TRACE
- trace(TR_BREADMISS, dev, blkno);
-#endif
-#ifdef DISKMON
- io_info.nread++;
-#endif
- u.u_vm.vm_inblk++; /* pay for read */
- iowait(bp);
- return(bp);
-}
-
-/*
- * Read in the block, like bread, but also start I/O on the
- * read-ahead block (which is not allocated to the caller)
- */
-struct buf *
-breada(dev, blkno, rablkno)
-dev_t dev;
-daddr_t blkno, rablkno;
-{
- register struct buf *bp, *rabp;
-
- bp = NULL;
- if (!incore(dev, blkno)) {
- bp = getblk(dev, blkno);
- if ((bp->b_flags&B_DONE) == 0) {
- bp->b_flags |= B_READ;
- bp->b_bcount = BSIZE;
- (*bdevsw[major(dev)].d_strategy)(bp);
-#ifdef TRACE
- trace(TR_BREADMISS, dev, blkno);
-#endif
-#ifdef DISKMON
- io_info.nread++;
-#endif
- u.u_vm.vm_inblk++; /* pay for read */
- }
-#ifdef TRACE
- else
- trace(TR_BREADHIT, dev, blkno);
-#endif
- }
- if (rablkno && !incore(dev, rablkno)) {
- rabp = getblk(dev, rablkno);
- if (rabp->b_flags & B_DONE) {
- brelse(rabp);
-#ifdef TRACE
- trace(TR_BREADHITRA, dev, blkno);
-#endif
- } else {
- rabp->b_flags |= B_READ|B_ASYNC;
- rabp->b_bcount = BSIZE;
- (*bdevsw[major(dev)].d_strategy)(rabp);
-#ifdef TRACE
- trace(TR_BREADMISSRA, dev, rablock);
-#endif
-#ifdef DISKMON
- io_info.nreada++;
-#endif
- u.u_vm.vm_inblk++; /* pay in advance */
- }
- }
- if(bp == NULL)
- return(bread(dev, blkno));
- iowait(bp);
- return(bp);
-}
-
-/*
- * Write the buffer, waiting for completion.
- * Then release the buffer.
- */
-bwrite(bp)
-register struct buf *bp;
-{
- register flag;
-
- flag = bp->b_flags;
- bp->b_flags &= ~(B_READ | B_DONE | B_ERROR | B_DELWRI | B_AGE);
- bp->b_bcount = BSIZE;
-#ifdef DISKMON
- io_info.nwrite++;
-#endif
- if ((flag&B_DELWRI) == 0)
- u.u_vm.vm_oublk++; /* noone paid yet */
-#ifdef TRACE
- trace(TR_BWRITE, bp->b_dev, dbtofsb(bp->b_blkno));
-#endif
- (*bdevsw[major(bp->b_dev)].d_strategy)(bp);
- if ((flag&B_ASYNC) == 0) {
- iowait(bp);
- brelse(bp);
- } else if (flag & B_DELWRI)
- bp->b_flags |= B_AGE;
- else
- geterror(bp);
-}
-
-/*
- * Release the buffer, marking it so that if it is grabbed
- * for another purpose it will be written out before being
- * given up (e.g. when writing a partial block where it is
- * assumed that another write for the same block will soon follow).
- * This can't be done for magtape, since writes must be done
- * in the same order as requested.
- */
-bdwrite(bp)
-register struct buf *bp;
-{
- register int flags;
-
- if ((bp->b_flags&B_DELWRI) == 0)
- u.u_vm.vm_oublk++; /* noone paid yet */
- flags = bdevsw[major(bp->b_dev)].d_flags;
- if(flags & B_TAPE)
- bawrite(bp);
- else {
- bp->b_flags |= B_DELWRI | B_DONE;
- brelse(bp);
- }
-}
-
-/*
- * Release the buffer, start I/O on it, but don't wait for completion.
- */
-bawrite(bp)
-register struct buf *bp;
-{
-
- bp->b_flags |= B_ASYNC;
- bwrite(bp);
-}
-
-/*
- * release the buffer, with no I/O implied.
- */
-brelse(bp)
-register struct buf *bp;
-{
- register struct buf *flist;
- register s;
-
- if (bp->b_flags&B_WANTED)
- wakeup((caddr_t)bp);
- if (bfreelist[0].b_flags&B_WANTED) {
- bfreelist[0].b_flags &= ~B_WANTED;
- wakeup((caddr_t)bfreelist);
- }
- if (bp->b_flags&B_ERROR)
- if (bp->b_flags & B_LOCKED)
- bp->b_flags &= ~B_ERROR; /* try again later */
- else
- bp->b_dev = NODEV; /* no assoc */
- s = spl6();
- if (bp->b_flags & (B_ERROR|B_INVAL)) {
- /* block has no info ... put at front of most free list */
- flist = &bfreelist[BQUEUES-1];
- flist->av_forw->av_back = bp;
- bp->av_forw = flist->av_forw;
- flist->av_forw = bp;
- bp->av_back = flist;
- } else {
- if (bp->b_flags & B_LOCKED)
- flist = &bfreelist[BQ_LOCKED];
- else if (bp->b_flags & B_AGE)
- flist = &bfreelist[BQ_AGE];
- else
- flist = &bfreelist[BQ_LRU];
- flist->av_back->av_forw = bp;
- bp->av_back = flist->av_back;
- flist->av_back = bp;
- bp->av_forw = flist;
- }
- bp->b_flags &= ~(B_WANTED|B_BUSY|B_ASYNC|B_AGE);
- splx(s);
-}
-
-/*
- * See if the block is associated with some buffer
- * (mainly to avoid getting hung up on a wait in breada)
- */
-incore(dev, blkno)
-dev_t dev;
-daddr_t blkno;
-{
- register struct buf *bp;
- register struct buf *dp;
- register int dblkno = fsbtodb(blkno);
-
- dp = BUFHASH(dev, dblkno);
- for (bp = dp->b_forw; bp != dp; bp = bp->b_forw)
- if (bp->b_blkno == dblkno && bp->b_dev == dev &&
- !(bp->b_flags & B_INVAL))
- return (1);
- return (0);
-}
-
-struct buf *
-baddr(dev, blkno)
-dev_t dev;
-daddr_t blkno;
-{
-
- if (incore(dev, blkno))
- return (bread(dev, blkno));
- return (0);
-}
-
-/*
- * Assign a buffer for the given block. If the appropriate
- * block is already associated, return it; otherwise search
- * for the oldest non-busy buffer and reassign it.
- */
-struct buf *
-getblk(dev, blkno)
-dev_t dev;
-daddr_t blkno;
-{
- register struct buf *bp, *dp, *ep;
- register int dblkno = fsbtodb(blkno);
-#ifdef DISKMON
- register int i;
-#endif
-
- if ((unsigned)blkno >= 1 << (sizeof(int)*NBBY-PGSHIFT))
- blkno = 1 << ((sizeof(int)*NBBY-PGSHIFT) + 1);
- dblkno = fsbtodb(blkno);
- dp = BUFHASH(dev, dblkno);
- loop:
- (void) spl0();
- for (bp = dp->b_forw; bp != dp; bp = bp->b_forw) {
- if (bp->b_blkno != dblkno || bp->b_dev != dev ||
- bp->b_flags&B_INVAL)
- continue;
- (void) spl6();
- if (bp->b_flags&B_BUSY) {
- bp->b_flags |= B_WANTED;
- sleep((caddr_t)bp, PRIBIO+1);
- goto loop;
- }
- (void) spl0();
-#ifdef DISKMON
- i = 0;
- dp = bp->av_forw;
- while ((dp->b_flags & B_HEAD) == 0) {
- i++;
- dp = dp->av_forw;
- }
- if (i<64)
- io_info.bufcount[i]++;
-#endif
- notavail(bp);
- bp->b_flags |= B_CACHE;
- return(bp);
- }
- if (major(dev) >= nblkdev)
- panic("blkdev");
- (void) spl6();
- for (ep = &bfreelist[BQUEUES-1]; ep > bfreelist; ep--)
- if (ep->av_forw != ep)
- break;
- if (ep == bfreelist) { /* no free blocks at all */
- ep->b_flags |= B_WANTED;
- sleep((caddr_t)ep, PRIBIO+1);
- goto loop;
- }
- (void) spl0();
- bp = ep->av_forw;
- notavail(bp);
- if (bp->b_flags & B_DELWRI) {
- bp->b_flags |= B_ASYNC;
- bwrite(bp);
- goto loop;
- }
-#ifdef TRACE
- trace(TR_BRELSE, bp->b_dev, dbtofsb(bp->b_blkno));
-#endif
- bp->b_flags = B_BUSY;
- bp->b_back->b_forw = bp->b_forw;
- bp->b_forw->b_back = bp->b_back;
- bp->b_forw = dp->b_forw;
- bp->b_back = dp;
- dp->b_forw->b_back = bp;
- dp->b_forw = bp;
- bp->b_dev = dev;
- bp->b_blkno = dblkno;
- return(bp);
-}
-
-/*
- * get an empty block,
- * not assigned to any particular device
- */
-struct buf *
-geteblk()
-{
- register struct buf *bp, *dp;
-
-loop:
- (void) spl6();
- for (dp = &bfreelist[BQUEUES-1]; dp > bfreelist; dp--)
- if (dp->av_forw != dp)
- break;
- if (dp == bfreelist) { /* no free blocks */
- dp->b_flags |= B_WANTED;
- sleep((caddr_t)dp, PRIBIO+1);
- goto loop;
- }
- (void) spl0();
- bp = dp->av_forw;
- notavail(bp);
- if (bp->b_flags & B_DELWRI) {
- bp->b_flags |= B_ASYNC;
- bwrite(bp);
- goto loop;
- }
-#ifdef TRACE
- trace(TR_BRELSE, bp->b_dev, dbtofsb(bp->b_blkno));
-#endif
- bp->b_flags = B_BUSY|B_INVAL;
- bp->b_back->b_forw = bp->b_forw;
- bp->b_forw->b_back = bp->b_back;
- bp->b_forw = dp->b_forw;
- bp->b_back = dp;
- dp->b_forw->b_back = bp;
- dp->b_forw = bp;
- bp->b_dev = (dev_t)NODEV;
- return(bp);
-}
-
-/*
- * Wait for I/O completion on the buffer; return errors
- * to the user.
+ * Copyright (c) 1982, 1986, 1990 Regents of the University of California.
+ * All rights reserved.
+ *
+ * Redistribution and use in source and binary forms, with or without
+ * modification, are permitted provided that the following conditions
+ * are met:
+ * 1. Redistributions of source code must retain the above copyright
+ * notice, this list of conditions and the following disclaimer.
+ * 2. Redistributions in binary form must reproduce the above copyright
+ * notice, this list of conditions and the following disclaimer in the
+ * documentation and/or other materials provided with the distribution.
+ * 3. All advertising materials mentioning features or use of this software
+ * must display the following acknowledgement:
+ * This product includes software developed by the University of
+ * California, Berkeley and its contributors.
+ * 4. Neither the name of the University nor the names of its contributors
+ * may be used to endorse or promote products derived from this software
+ * without specific prior written permission.
+ *
+ * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
+ * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
+ * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
+ * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
+ * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
+ * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
+ * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
+ * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
+ * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
+ * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
+ * SUCH DAMAGE.
+ *
+ * from: @(#)kern_physio.c 7.20 (Berkeley) 5/11/91
projects / unix-history / blobdiff