- allocbuf(bp, size);
- return (1);
-}
-
-/*
- * Expand or contract the actual memory allocated to a buffer.
- */
-allocbuf(tp, size)
- register struct buf *tp;
- int size;
-{
- register struct buf *bp, *ep;
- int sizealloc, take;
-
- sizealloc = roundup(size, CLBYTES);
- /*
- * Buffer size does not change
- */
- if (sizealloc == tp->b_bufsize)
- goto out;
- /*
- * Buffer size is shrinking.
- * Place excess space in a buffer header taken from the
- * BQ_EMPTY buffer list and placed on the "most free" list.
- * If no extra buffer headers are available, leave the
- * extra space in the present buffer.
- */
- if (sizealloc < tp->b_bufsize) {
- ep = bfreelist[BQ_EMPTY].av_forw;
- if (ep == &bfreelist[BQ_EMPTY])
- goto out;
- notavail(ep);
- pagemove(tp->b_un.b_addr + sizealloc, ep->b_un.b_addr,
- (int)tp->b_bufsize - sizealloc);
- ep->b_bufsize = tp->b_bufsize - sizealloc;
- tp->b_bufsize = sizealloc;
- ep->b_flags |= B_INVAL;
- ep->b_bcount = 0;
- brelse(ep);
- goto out;
- }
- /*
- * More buffer space is needed. Get it out of buffers on
- * the "most free" list, placing the empty headers on the
- * BQ_EMPTY buffer header list.
- */
- while (tp->b_bufsize < sizealloc) {
- take = sizealloc - tp->b_bufsize;
- bp = getnewbuf();
- if (take >= bp->b_bufsize)
- take = bp->b_bufsize;
- pagemove(&bp->b_un.b_addr[bp->b_bufsize - take],
- &tp->b_un.b_addr[tp->b_bufsize], take);
- tp->b_bufsize += take;
- bp->b_bufsize = bp->b_bufsize - take;
- if (bp->b_bcount > bp->b_bufsize)
- bp->b_bcount = bp->b_bufsize;
- if (bp->b_bufsize <= 0) {
- bremhash(bp);
- binshash(bp, &bfreelist[BQ_EMPTY]);
- bp->b_dev = (dev_t)NODEV;
- bp->b_error = 0;
- bp->b_flags |= B_INVAL;
- }
- brelse(bp);
- }
-out:
- tp->b_bcount = size;
-}
-
-/*
- * Release space associated with a buffer.
- */
-bfree(bp)
- struct buf *bp;
-{
- /*
- * This stub is provided to allow the system to reclaim
- * memory from the buffer pool. Currently we do not migrate
- * memory between the buffer memory pool and the user memory
- * pool.
- */
- bp->b_bcount = 0;