Home | History | Annotate | Line # | Download | only in lfs
lfs_balloc.c revision 1.27.2.2
      1  1.27.2.2   nathanw /*	$NetBSD: lfs_balloc.c,v 1.27.2.2 2001/06/21 20:10:09 nathanw Exp $	*/
      2       1.2       cgd 
      3      1.11  perseant /*-
      4      1.25  perseant  * Copyright (c) 1999, 2000 The NetBSD Foundation, Inc.
      5      1.11  perseant  * All rights reserved.
      6      1.11  perseant  *
      7      1.11  perseant  * This code is derived from software contributed to The NetBSD Foundation
      8      1.11  perseant  * by Konrad E. Schroder <perseant (at) hhhh.org>.
      9      1.11  perseant  *
     10      1.11  perseant  * Redistribution and use in source and binary forms, with or without
     11      1.11  perseant  * modification, are permitted provided that the following conditions
     12      1.11  perseant  * are met:
     13      1.11  perseant  * 1. Redistributions of source code must retain the above copyright
     14      1.11  perseant  *    notice, this list of conditions and the following disclaimer.
     15      1.11  perseant  * 2. Redistributions in binary form must reproduce the above copyright
     16      1.11  perseant  *    notice, this list of conditions and the following disclaimer in the
     17      1.11  perseant  *    documentation and/or other materials provided with the distribution.
     18      1.11  perseant  * 3. All advertising materials mentioning features or use of this software
     19      1.11  perseant  *    must display the following acknowledgement:
     20      1.11  perseant  *      This product includes software developed by the NetBSD
     21      1.11  perseant  *      Foundation, Inc. and its contributors.
     22      1.11  perseant  * 4. Neither the name of The NetBSD Foundation nor the names of its
     23      1.11  perseant  *    contributors may be used to endorse or promote products derived
     24      1.11  perseant  *    from this software without specific prior written permission.
     25      1.11  perseant  *
     26      1.11  perseant  * THIS SOFTWARE IS PROVIDED BY THE NETBSD FOUNDATION, INC. AND CONTRIBUTORS
     27      1.11  perseant  * ``AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED
     28      1.11  perseant  * TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
     29      1.11  perseant  * PURPOSE ARE DISCLAIMED.  IN NO EVENT SHALL THE FOUNDATION OR CONTRIBUTORS
     30      1.11  perseant  * BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
     31      1.11  perseant  * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
     32      1.11  perseant  * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
     33      1.11  perseant  * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
     34      1.11  perseant  * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
     35      1.11  perseant  * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
     36      1.11  perseant  * POSSIBILITY OF SUCH DAMAGE.
     37      1.11  perseant  */
     38       1.1   mycroft /*
     39       1.1   mycroft  * Copyright (c) 1989, 1991, 1993
     40       1.1   mycroft  *	The Regents of the University of California.  All rights reserved.
     41       1.1   mycroft  *
     42       1.1   mycroft  * Redistribution and use in source and binary forms, with or without
     43       1.1   mycroft  * modification, are permitted provided that the following conditions
     44       1.1   mycroft  * are met:
     45       1.1   mycroft  * 1. Redistributions of source code must retain the above copyright
     46       1.1   mycroft  *    notice, this list of conditions and the following disclaimer.
     47       1.1   mycroft  * 2. Redistributions in binary form must reproduce the above copyright
     48       1.1   mycroft  *    notice, this list of conditions and the following disclaimer in the
     49       1.1   mycroft  *    documentation and/or other materials provided with the distribution.
     50       1.1   mycroft  * 3. All advertising materials mentioning features or use of this software
     51       1.1   mycroft  *    must display the following acknowledgement:
     52       1.1   mycroft  *	This product includes software developed by the University of
     53       1.1   mycroft  *	California, Berkeley and its contributors.
     54       1.1   mycroft  * 4. Neither the name of the University nor the names of its contributors
     55       1.1   mycroft  *    may be used to endorse or promote products derived from this software
     56       1.1   mycroft  *    without specific prior written permission.
     57       1.1   mycroft  *
     58       1.1   mycroft  * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
     59       1.1   mycroft  * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
     60       1.1   mycroft  * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
     61       1.1   mycroft  * ARE DISCLAIMED.  IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
     62       1.1   mycroft  * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
     63       1.1   mycroft  * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
     64       1.1   mycroft  * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
     65       1.1   mycroft  * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
     66       1.1   mycroft  * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
     67       1.1   mycroft  * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
     68       1.1   mycroft  * SUCH DAMAGE.
     69       1.1   mycroft  *
     70       1.5      fvdl  *	@(#)lfs_balloc.c	8.4 (Berkeley) 5/8/95
     71       1.1   mycroft  */
     72       1.8    scottr 
     73  1.27.2.2   nathanw #if defined(_KERNEL_OPT)
     74       1.8    scottr #include "opt_quota.h"
     75       1.9    scottr #endif
     76       1.8    scottr 
     77       1.1   mycroft #include <sys/param.h>
     78       1.3  christos #include <sys/systm.h>
     79       1.1   mycroft #include <sys/buf.h>
     80       1.1   mycroft #include <sys/proc.h>
     81       1.1   mycroft #include <sys/vnode.h>
     82       1.1   mycroft #include <sys/mount.h>
     83       1.1   mycroft #include <sys/resourcevar.h>
     84       1.1   mycroft #include <sys/trace.h>
     85       1.1   mycroft 
     86       1.1   mycroft #include <miscfs/specfs/specdev.h>
     87       1.1   mycroft 
     88       1.1   mycroft #include <ufs/ufs/quota.h>
     89       1.1   mycroft #include <ufs/ufs/inode.h>
     90       1.1   mycroft #include <ufs/ufs/ufsmount.h>
     91       1.3  christos #include <ufs/ufs/ufs_extern.h>
     92       1.1   mycroft 
     93       1.1   mycroft #include <ufs/lfs/lfs.h>
     94       1.1   mycroft #include <ufs/lfs/lfs_extern.h>
     95       1.5      fvdl 
     96       1.5      fvdl int lfs_fragextend __P((struct vnode *, int, int, ufs_daddr_t, struct buf **));
     97       1.5      fvdl 
     98      1.16  perseant /*
     99      1.16  perseant  * Allocate a block, and to inode and filesystem block accounting for it
    100      1.16  perseant  * and for any indirect blocks the may need to be created in order for
    101      1.16  perseant  * this block to be created.
    102      1.16  perseant  *
    103      1.16  perseant  * Blocks which have never been accounted for (i.e., which "do not exist")
    104      1.16  perseant  * have disk address 0, which is translated by ufs_bmap to the special value
    105      1.16  perseant  * UNASSIGNED == -1, as in the historical UFS.
    106      1.16  perseant  *
    107      1.16  perseant  * Blocks which have been accounted for but which have not yet been written
    108      1.16  perseant  * to disk are given the new special disk address UNWRITTEN == -2, so that
    109      1.16  perseant  * they can be differentiated from completely new blocks.
    110      1.16  perseant  */
    111      1.25  perseant /* VOP_BWRITE NIADDR+2 times */
    112       1.1   mycroft int
    113      1.14      fvdl lfs_balloc(v)
    114      1.14      fvdl 	void *v;
    115      1.14      fvdl {
    116      1.14      fvdl 	struct vop_balloc_args /* {
    117      1.14      fvdl 		struct vnode *a_vp;
    118      1.14      fvdl 		off_t a_startoffset;
    119      1.14      fvdl 		int a_size;
    120      1.14      fvdl 		struct ucred *a_cred;
    121      1.14      fvdl 		int a_flags;
    122      1.14      fvdl 		struct buf *a_bpp;
    123      1.14      fvdl 	} */ *ap = v;
    124       1.1   mycroft 	struct vnode *vp;
    125       1.5      fvdl 	int offset;
    126       1.1   mycroft 	u_long iosize;
    127      1.19  perseant 	daddr_t daddr, idaddr;
    128       1.1   mycroft 	struct buf *ibp, *bp;
    129       1.1   mycroft 	struct inode *ip;
    130       1.1   mycroft 	struct lfs *fs;
    131      1.16  perseant 	struct indir indirs[NIADDR+2], *idp;
    132      1.19  perseant 	ufs_daddr_t	lbn, lastblock;
    133      1.19  perseant 	int bb, bcount;
    134      1.11  perseant 	int error, frags, i, nsize, osize, num;
    135      1.14      fvdl 
    136      1.14      fvdl 	vp = ap->a_vp;
    137       1.1   mycroft 	ip = VTOI(vp);
    138       1.1   mycroft 	fs = ip->i_lfs;
    139      1.14      fvdl 	offset = blkoff(fs, ap->a_startoffset);
    140      1.14      fvdl 	iosize = ap->a_size;
    141      1.14      fvdl 	lbn = lblkno(fs, ap->a_startoffset);
    142      1.14      fvdl 	(void)lfs_check(vp, lbn, 0);
    143      1.11  perseant 
    144       1.1   mycroft 	/*
    145       1.1   mycroft 	 * Three cases: it's a block beyond the end of file, it's a block in
    146       1.1   mycroft 	 * the file that may or may not have been assigned a disk address or
    147      1.19  perseant 	 * we're writing an entire block.
    148      1.19  perseant 	 *
    149      1.19  perseant 	 * Note, if the daddr is UNWRITTEN, the block already exists in
    150      1.19  perseant 	 * the cache (it was read or written earlier).  If so, make sure
    151      1.19  perseant 	 * we don't count it as a new block or zero out its contents. If
    152      1.19  perseant 	 * it did not, make sure we allocate any necessary indirect
    153      1.19  perseant 	 * blocks.
    154      1.19  perseant 	 *
    155       1.5      fvdl 	 * If we are writing a block beyond the end of the file, we need to
    156      1.11  perseant 	 * check if the old last block was a fragment.	If it was, we need
    157       1.5      fvdl 	 * to rewrite it.
    158       1.1   mycroft 	 */
    159      1.11  perseant 
    160      1.14      fvdl 	*ap->a_bpp = NULL;
    161      1.11  perseant 
    162       1.5      fvdl 	/* Check for block beyond end of file and fragment extension needed. */
    163       1.5      fvdl 	lastblock = lblkno(fs, ip->i_ffs_size);
    164       1.5      fvdl 	if (lastblock < NDADDR && lastblock < lbn) {
    165       1.5      fvdl 		osize = blksize(fs, ip, lastblock);
    166       1.5      fvdl 		if (osize < fs->lfs_bsize && osize > 0) {
    167       1.5      fvdl 			if ((error = lfs_fragextend(vp, osize, fs->lfs_bsize,
    168      1.11  perseant 						    lastblock, &bp)))
    169       1.5      fvdl 				return(error);
    170       1.5      fvdl 			ip->i_ffs_size = (lastblock + 1) * fs->lfs_bsize;
    171       1.7  drochner 			uvm_vnp_setsize(vp, ip->i_ffs_size);
    172       1.5      fvdl 			ip->i_flag |= IN_CHANGE | IN_UPDATE;
    173      1.25  perseant 			(void) VOP_BWRITE(bp);
    174       1.5      fvdl 		}
    175       1.5      fvdl 	}
    176       1.5      fvdl 
    177       1.5      fvdl 	/*
    178       1.5      fvdl 	 * If the block we are writing is a direct block, it's the last
    179       1.5      fvdl 	 * block in the file, and offset + iosize is less than a full
    180       1.5      fvdl 	 * block, we can write one or more fragments.  There are two cases:
    181       1.5      fvdl 	 * the block is brand new and we should allocate it the correct
    182       1.5      fvdl 	 * size or it already exists and contains some fragments and
    183       1.5      fvdl 	 * may need to extend it.
    184       1.5      fvdl 	 */
    185      1.11  perseant 	if (lbn < NDADDR && lblkno(fs, ip->i_ffs_size) <= lbn) {
    186      1.11  perseant 		osize = blksize(fs, ip, lbn);
    187       1.5      fvdl 		nsize = fragroundup(fs, offset + iosize);
    188      1.19  perseant 		if (lblktosize(fs, lbn) >= ip->i_ffs_size) {
    189       1.5      fvdl 			/* Brand new block or fragment */
    190      1.19  perseant 			frags = numfrags(fs, nsize);
    191      1.19  perseant 			bb = fragstodb(fs, frags);
    192      1.14      fvdl 			*ap->a_bpp = bp = getblk(vp, lbn, nsize, 0, 0);
    193      1.21  perseant 			ip->i_lfs_effnblks += bb;
    194      1.19  perseant 			ip->i_lfs->lfs_bfree -= bb;
    195      1.19  perseant 			ip->i_ffs_db[lbn] = bp->b_blkno = UNWRITTEN;
    196      1.19  perseant 		} else {
    197      1.11  perseant 			if (nsize <= osize) {
    198      1.11  perseant 				/* No need to extend */
    199      1.11  perseant 				if ((error = bread(vp, lbn, osize, NOCRED, &bp)))
    200      1.11  perseant 					return error;
    201      1.11  perseant 			} else {
    202      1.11  perseant 				/* Extend existing block */
    203      1.11  perseant 				if ((error =
    204      1.11  perseant 				     lfs_fragextend(vp, osize, nsize, lbn, &bp)))
    205      1.19  perseant 					return error;
    206      1.11  perseant 			}
    207      1.14      fvdl 			*ap->a_bpp = bp;
    208       1.5      fvdl 		}
    209      1.19  perseant 		return 0;
    210      1.19  perseant 	}
    211      1.19  perseant 
    212      1.19  perseant 	error = ufs_bmaparray(vp, lbn, &daddr, &indirs[0], &num, NULL );
    213      1.19  perseant 	if (error)
    214      1.19  perseant 		return (error);
    215      1.19  perseant 	/*
    216      1.19  perseant 	 * Do byte accounting all at once, so we can gracefully fail *before*
    217      1.19  perseant 	 * we start assigning blocks.
    218      1.19  perseant 	 */
    219      1.19  perseant 	bb = VFSTOUFS(vp->v_mount)->um_seqinc;
    220      1.19  perseant 	bcount = 0;
    221      1.19  perseant 	if (daddr == UNASSIGNED) {
    222      1.19  perseant 		bcount = bb;
    223      1.19  perseant 	}
    224      1.19  perseant 	for (i = 1; i < num; ++i) {
    225      1.19  perseant 		if (!indirs[i].in_exists) {
    226      1.19  perseant 			bcount += bb;
    227      1.19  perseant 		}
    228      1.19  perseant 	}
    229      1.19  perseant 	if (ISSPACE(fs, bcount, ap->a_cred)) {
    230      1.19  perseant 		ip->i_lfs->lfs_bfree -= bcount;
    231      1.21  perseant 		ip->i_lfs_effnblks += bcount;
    232       1.5      fvdl 	} else {
    233      1.19  perseant 		return ENOSPC;
    234      1.19  perseant 	}
    235      1.19  perseant 
    236      1.19  perseant 	if (daddr == UNASSIGNED) {
    237      1.19  perseant 		if (num > 0 && ip->i_ffs_ib[indirs[0].in_off] == 0) {
    238      1.19  perseant 			ip->i_ffs_ib[indirs[0].in_off] = UNWRITTEN;
    239      1.19  perseant 		}
    240      1.19  perseant 
    241       1.5      fvdl 		/*
    242      1.19  perseant 		 * Create new indirect blocks if necessary
    243       1.5      fvdl 		 */
    244      1.19  perseant 		if (num > 1)
    245      1.19  perseant 			idaddr = ip->i_ffs_ib[indirs[0].in_off];
    246      1.19  perseant 		for (i = 1; i < num; ++i) {
    247      1.19  perseant 			ibp = getblk(vp, indirs[i].in_lbn, fs->lfs_bsize, 0,0);
    248      1.19  perseant 			if (!indirs[i].in_exists) {
    249      1.19  perseant 				clrbuf(ibp);
    250      1.19  perseant 				ibp->b_blkno = UNWRITTEN;
    251      1.19  perseant 			} else if (!(ibp->b_flags & (B_DELWRI | B_DONE))) {
    252      1.19  perseant 				ibp->b_blkno = idaddr;
    253      1.19  perseant 				ibp->b_flags |= B_READ;
    254      1.19  perseant 				VOP_STRATEGY(ibp);
    255      1.19  perseant 				biowait(ibp);
    256      1.19  perseant 			}
    257      1.19  perseant 			/*
    258      1.19  perseant 			 * This block exists, but the next one may not.
    259      1.19  perseant 			 * If that is the case mark it UNWRITTEN to keep
    260      1.19  perseant 			 * the accounting straight.
    261      1.19  perseant 			 */
    262      1.19  perseant 			if (((daddr_t *)ibp->b_data)[indirs[i].in_off]==0)
    263      1.19  perseant 				((daddr_t *)ibp->b_data)[indirs[i].in_off] =
    264      1.19  perseant 					UNWRITTEN;
    265      1.19  perseant 			idaddr = ((daddr_t *)ibp->b_data)[indirs[i].in_off];
    266      1.19  perseant 			if ((error = VOP_BWRITE(ibp))) {
    267      1.19  perseant 				return error;
    268      1.19  perseant 			}
    269      1.19  perseant 		}
    270      1.19  perseant 	}
    271      1.19  perseant 
    272      1.19  perseant 
    273      1.19  perseant 	/*
    274      1.19  perseant 	 * Get the existing block from the cache.
    275      1.19  perseant 	 */
    276      1.19  perseant 	frags = dbtofrags(fs, bb);
    277      1.19  perseant 	*ap->a_bpp = bp = getblk(vp, lbn, blksize(fs, ip, lbn), 0, 0);
    278      1.11  perseant 
    279       1.5      fvdl 	/*
    280       1.5      fvdl 	 * The block we are writing may be a brand new block
    281      1.19  perseant 	 * in which case we need to do accounting.
    282      1.15  perseant 	 *
    283      1.19  perseant 	 * We can tell a truly new block because ufs_bmaparray will say
    284      1.19  perseant 	 * it is UNASSIGNED.  Once we allocate it we will assign it the
    285      1.19  perseant 	 * disk address UNWRITTEN.
    286       1.5      fvdl 	 */
    287      1.16  perseant 	if (daddr == UNASSIGNED) {
    288      1.19  perseant 		if (iosize != fs->lfs_bsize)
    289      1.19  perseant 			clrbuf(bp);
    290      1.19  perseant 
    291      1.19  perseant 		/* Note the new address */
    292      1.19  perseant 		bp->b_blkno = UNWRITTEN;
    293      1.19  perseant 
    294      1.19  perseant 		switch (num) {
    295      1.19  perseant 		    case 0:
    296      1.19  perseant 			ip->i_ffs_db[lbn] = UNWRITTEN;
    297      1.19  perseant 			break;
    298      1.19  perseant 		    case 1:
    299      1.19  perseant 			ip->i_ffs_ib[indirs[0].in_off] = UNWRITTEN;
    300      1.19  perseant 			break;
    301      1.19  perseant 		    default:
    302      1.19  perseant 			idp = &indirs[num - 1];
    303      1.19  perseant 			if (bread(vp, idp->in_lbn, fs->lfs_bsize, NOCRED,
    304      1.19  perseant 				  &ibp))
    305      1.19  perseant 				panic("lfs_balloc: bread bno %d", idp->in_lbn);
    306      1.19  perseant 			((ufs_daddr_t *)ibp->b_data)[idp->in_off] = UNWRITTEN;
    307      1.19  perseant 			VOP_BWRITE(ibp);
    308      1.15  perseant 		}
    309      1.15  perseant 	} else if (!(bp->b_flags & (B_DONE|B_DELWRI))) {
    310      1.15  perseant 		/*
    311      1.15  perseant 		 * Not a brand new block, also not in the cache;
    312      1.15  perseant 		 * read it in from disk.
    313      1.15  perseant 		 */
    314      1.15  perseant 		if (iosize == fs->lfs_bsize)
    315       1.5      fvdl 			/* Optimization: I/O is unnecessary. */
    316       1.5      fvdl 			bp->b_blkno = daddr;
    317      1.15  perseant 		else {
    318       1.5      fvdl 			/*
    319       1.5      fvdl 			 * We need to read the block to preserve the
    320       1.5      fvdl 			 * existing bytes.
    321       1.5      fvdl 			 */
    322       1.1   mycroft 			bp->b_blkno = daddr;
    323       1.1   mycroft 			bp->b_flags |= B_READ;
    324       1.1   mycroft 			VOP_STRATEGY(bp);
    325       1.1   mycroft 			return(biowait(bp));
    326       1.1   mycroft 		}
    327       1.1   mycroft 	}
    328      1.11  perseant 
    329       1.5      fvdl 	return (0);
    330       1.5      fvdl }
    331       1.5      fvdl 
    332      1.25  perseant /* VOP_BWRITE 1 time */
    333       1.5      fvdl int
    334       1.5      fvdl lfs_fragextend(vp, osize, nsize, lbn, bpp)
    335       1.5      fvdl 	struct vnode *vp;
    336       1.5      fvdl 	int osize;
    337       1.5      fvdl 	int nsize;
    338       1.5      fvdl 	ufs_daddr_t lbn;
    339       1.5      fvdl 	struct buf **bpp;
    340       1.5      fvdl {
    341       1.5      fvdl 	struct inode *ip;
    342       1.5      fvdl 	struct lfs *fs;
    343       1.5      fvdl 	long bb;
    344       1.5      fvdl 	int error;
    345      1.11  perseant 	extern long locked_queue_bytes;
    346      1.13  perseant 	struct buf *ibp;
    347      1.26  perseant 	size_t obufsize;
    348      1.13  perseant 	SEGUSE *sup;
    349       1.5      fvdl 
    350       1.5      fvdl 	ip = VTOI(vp);
    351       1.5      fvdl 	fs = ip->i_lfs;
    352       1.5      fvdl 	bb = (long)fragstodb(fs, numfrags(fs, nsize - osize));
    353      1.18  perseant 	error = 0;
    354      1.18  perseant 
    355      1.18  perseant 	/*
    356      1.18  perseant 	 * Get the seglock so we don't enlarge blocks or change the segment
    357      1.18  perseant 	 * accounting information while a segment is being written.
    358      1.18  perseant 	 */
    359      1.26  perseant     top:
    360      1.18  perseant 	lfs_seglock(fs, SEGM_PROT);
    361      1.18  perseant 
    362  1.27.2.1   nathanw 	if (!ISSPACE(fs, bb, curproc->l_proc->p_ucred)) {
    363      1.18  perseant 		error = ENOSPC;
    364      1.18  perseant 		goto out;
    365       1.5      fvdl 	}
    366       1.5      fvdl 	if ((error = bread(vp, lbn, osize, NOCRED, bpp))) {
    367       1.5      fvdl 		brelse(*bpp);
    368      1.18  perseant 		goto out;
    369       1.5      fvdl 	}
    370      1.19  perseant #ifdef QUOTA
    371  1.27.2.1   nathanw 	if ((error = chkdq(ip, bb, curproc->l_proc->p_ucred, 0))) {
    372      1.19  perseant 		brelse(*bpp);
    373      1.19  perseant 		goto out;
    374      1.19  perseant 	}
    375      1.19  perseant #endif
    376      1.13  perseant 	/*
    377      1.26  perseant 	 * Adjust accounting for lfs_avail.  If there's not enough room,
    378      1.26  perseant 	 * we will have to wait for the cleaner, which we can't do while
    379      1.26  perseant 	 * holding a block busy or while holding the seglock.  In that case,
    380      1.26  perseant 	 * release both and start over after waiting.
    381      1.26  perseant 	 */
    382      1.26  perseant 	if ((*bpp)->b_flags & B_DELWRI) {
    383      1.26  perseant 		if (!lfs_fits(fs, bb)) {
    384      1.26  perseant 			brelse(*bpp);
    385      1.26  perseant #ifdef QUOTA
    386  1.27.2.1   nathanw 			chkdq(ip, -bb, curproc->l_proc->p_ucred, 0);
    387      1.26  perseant #endif
    388      1.26  perseant 			lfs_segunlock(fs);
    389      1.26  perseant 			lfs_availwait(fs, bb);
    390      1.26  perseant 			goto top;
    391      1.26  perseant 		}
    392      1.26  perseant 		fs->lfs_avail -= bb;
    393      1.26  perseant 	}
    394      1.26  perseant 
    395      1.26  perseant 	/*
    396      1.13  perseant  	 * Fix the allocation for this fragment so that it looks like the
    397      1.13  perseant          * source segment contained a block of the new size.  This overcounts;
    398      1.13  perseant 	 * but the overcount only lasts until the block in question
    399      1.13  perseant 	 * is written, so the on-disk live bytes count is always correct.
    400      1.13  perseant 	 */
    401      1.17  perseant 	if ((*bpp)->b_blkno > 0) {
    402      1.26  perseant 		LFS_SEGENTRY(sup, fs, datosn(fs, (*bpp)->b_blkno), ibp);
    403      1.26  perseant 		sup->su_nbytes += (nsize - osize);
    404      1.17  perseant 		VOP_BWRITE(ibp);
    405      1.23  perseant 		ip->i_ffs_blocks += bb;
    406      1.17  perseant 	}
    407      1.19  perseant 	fs->lfs_bfree -= bb;
    408      1.22  perseant 	ip->i_lfs_effnblks += bb;
    409       1.5      fvdl 	ip->i_flag |= IN_CHANGE | IN_UPDATE;
    410      1.26  perseant 
    411      1.26  perseant 	obufsize = (*bpp)->b_bufsize;
    412       1.5      fvdl 	allocbuf(*bpp, nsize);
    413      1.26  perseant 
    414      1.26  perseant 	/* Adjust locked-list accounting */
    415      1.26  perseant 	if (((*bpp)->b_flags & (B_LOCKED | B_CALL)) == B_LOCKED)
    416      1.27  perseant 		locked_queue_bytes += (*bpp)->b_bufsize - obufsize;
    417      1.26  perseant 
    418       1.5      fvdl 	bzero((char *)((*bpp)->b_data) + osize, (u_int)(nsize - osize));
    419      1.18  perseant 
    420      1.18  perseant     out:
    421      1.18  perseant 	lfs_segunlock(fs);
    422      1.18  perseant 	return (error);
    423       1.1   mycroft }
    424