2002-06-05 09:23:51 +04:00
|
|
|
/* $NetBSD: ffs_balloc.c,v 1.30 2002/06/05 05:23:51 chs Exp $ */
|
1994-06-29 10:39:25 +04:00
|
|
|
|
1994-06-08 15:41:58 +04:00
|
|
|
/*
|
|
|
|
* Copyright (c) 1982, 1986, 1989, 1993
|
|
|
|
* The 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.
|
|
|
|
*
|
1998-03-01 05:20:01 +03:00
|
|
|
* @(#)ffs_balloc.c 8.8 (Berkeley) 6/16/95
|
1994-06-08 15:41:58 +04:00
|
|
|
*/
|
|
|
|
|
2001-10-30 04:11:53 +03:00
|
|
|
#include <sys/cdefs.h>
|
2002-06-05 09:23:51 +04:00
|
|
|
__KERNEL_RCSID(0, "$NetBSD: ffs_balloc.c,v 1.30 2002/06/05 05:23:51 chs Exp $");
|
2001-10-30 04:11:53 +03:00
|
|
|
|
2001-05-30 15:57:16 +04:00
|
|
|
#if defined(_KERNEL_OPT)
|
1998-06-08 08:27:50 +04:00
|
|
|
#include "opt_quota.h"
|
1998-06-09 11:46:31 +04:00
|
|
|
#endif
|
1998-02-10 17:08:44 +03:00
|
|
|
|
1994-06-08 15:41:58 +04:00
|
|
|
#include <sys/param.h>
|
|
|
|
#include <sys/systm.h>
|
|
|
|
#include <sys/buf.h>
|
|
|
|
#include <sys/file.h>
|
1999-11-15 21:49:07 +03:00
|
|
|
#include <sys/mount.h>
|
1994-06-08 15:41:58 +04:00
|
|
|
#include <sys/vnode.h>
|
1998-03-18 18:57:26 +03:00
|
|
|
#include <sys/mount.h>
|
1994-06-08 15:41:58 +04:00
|
|
|
|
|
|
|
#include <ufs/ufs/quota.h>
|
1998-03-18 18:57:26 +03:00
|
|
|
#include <ufs/ufs/ufsmount.h>
|
1994-06-08 15:41:58 +04:00
|
|
|
#include <ufs/ufs/inode.h>
|
|
|
|
#include <ufs/ufs/ufs_extern.h>
|
1998-03-18 18:57:26 +03:00
|
|
|
#include <ufs/ufs/ufs_bswap.h>
|
1994-06-08 15:41:58 +04:00
|
|
|
|
|
|
|
#include <ufs/ffs/fs.h>
|
|
|
|
#include <ufs/ffs/ffs_extern.h>
|
|
|
|
|
2000-11-27 11:39:39 +03:00
|
|
|
#include <uvm/uvm.h>
|
|
|
|
|
1994-06-08 15:41:58 +04:00
|
|
|
/*
|
|
|
|
* Balloc defines the structure of file system storage
|
|
|
|
* by allocating the physical blocks on a device given
|
|
|
|
* the inode and the logical block number in a file.
|
|
|
|
*/
|
1996-02-10 01:22:18 +03:00
|
|
|
int
|
1999-11-15 21:49:07 +03:00
|
|
|
ffs_balloc(v)
|
|
|
|
void *v;
|
|
|
|
{
|
|
|
|
struct vop_balloc_args /* {
|
|
|
|
struct vnode *a_vp;
|
2001-08-08 12:36:36 +04:00
|
|
|
off_t a_startoffset;
|
1999-11-15 21:49:07 +03:00
|
|
|
int a_size;
|
|
|
|
struct ucred *a_cred;
|
|
|
|
int a_flags;
|
2000-11-27 11:39:39 +03:00
|
|
|
struct buf **a_bpp;
|
1999-11-15 21:49:07 +03:00
|
|
|
} */ *ap = v;
|
|
|
|
ufs_daddr_t lbn;
|
1994-06-08 15:41:58 +04:00
|
|
|
int size;
|
|
|
|
struct ucred *cred;
|
|
|
|
int flags;
|
1999-11-15 21:49:07 +03:00
|
|
|
ufs_daddr_t nb;
|
1994-06-08 15:41:58 +04:00
|
|
|
struct buf *bp, *nbp;
|
1999-11-15 21:49:07 +03:00
|
|
|
struct vnode *vp = ap->a_vp;
|
|
|
|
struct inode *ip = VTOI(vp);
|
|
|
|
struct fs *fs = ip->i_fs;
|
1994-06-08 15:41:58 +04:00
|
|
|
struct indir indirs[NIADDR + 2];
|
1998-03-01 05:20:01 +03:00
|
|
|
ufs_daddr_t newb, *bap, pref;
|
|
|
|
int deallocated, osize, nsize, num, i, error;
|
|
|
|
ufs_daddr_t *allocib, *blkp, *allocblk, allociblk[NIADDR + 1];
|
2000-02-25 22:58:25 +03:00
|
|
|
int unwindidx = -1;
|
2000-11-27 11:39:39 +03:00
|
|
|
struct buf **bpp = ap->a_bpp;
|
1999-11-15 21:49:07 +03:00
|
|
|
#ifdef FFS_EI
|
|
|
|
const int needswap = UFS_FSNEEDSWAP(fs);
|
|
|
|
#endif
|
2000-11-27 11:39:39 +03:00
|
|
|
UVMHIST_FUNC("ffs_balloc"); UVMHIST_CALLED(ubchist);
|
1994-06-08 15:41:58 +04:00
|
|
|
|
1999-11-15 21:49:07 +03:00
|
|
|
lbn = lblkno(fs, ap->a_startoffset);
|
|
|
|
size = blkoff(fs, ap->a_startoffset) + ap->a_size;
|
|
|
|
if (size > fs->fs_bsize)
|
|
|
|
panic("ffs_balloc: blk too big");
|
2000-11-27 11:39:39 +03:00
|
|
|
if (bpp != NULL) {
|
|
|
|
*bpp = NULL;
|
|
|
|
}
|
|
|
|
UVMHIST_LOG(ubchist, "vp %p lbn 0x%x size 0x%x", vp, lbn, size,0);
|
|
|
|
|
|
|
|
KASSERT(size <= fs->fs_bsize);
|
1998-03-01 05:20:01 +03:00
|
|
|
if (lbn < 0)
|
1994-06-08 15:41:58 +04:00
|
|
|
return (EFBIG);
|
1999-11-15 21:49:07 +03:00
|
|
|
cred = ap->a_cred;
|
|
|
|
flags = ap->a_flags;
|
1994-06-08 15:41:58 +04:00
|
|
|
|
|
|
|
/*
|
|
|
|
* If the next write will extend the file into a new block,
|
|
|
|
* and the file is currently composed of a fragment
|
|
|
|
* this fragment has to be extended to be a full block.
|
|
|
|
*/
|
2000-11-27 11:39:39 +03:00
|
|
|
|
1997-06-11 14:09:37 +04:00
|
|
|
nb = lblkno(fs, ip->i_ffs_size);
|
1998-03-01 05:20:01 +03:00
|
|
|
if (nb < NDADDR && nb < lbn) {
|
1994-06-08 15:41:58 +04:00
|
|
|
osize = blksize(fs, ip, nb);
|
|
|
|
if (osize < fs->fs_bsize && osize > 0) {
|
|
|
|
error = ffs_realloccg(ip, nb,
|
1997-06-11 14:09:37 +04:00
|
|
|
ffs_blkpref(ip, nb, (int)nb, &ip->i_ffs_db[0]),
|
2000-11-27 11:39:39 +03:00
|
|
|
osize, (int)fs->fs_bsize, cred, bpp, &newb);
|
1994-06-08 15:41:58 +04:00
|
|
|
if (error)
|
|
|
|
return (error);
|
1999-11-15 21:49:07 +03:00
|
|
|
if (DOINGSOFTDEP(vp))
|
2000-11-27 11:39:39 +03:00
|
|
|
softdep_setup_allocdirect(ip, nb, newb,
|
1999-11-15 21:49:07 +03:00
|
|
|
ufs_rw32(ip->i_ffs_db[nb], needswap),
|
2000-11-27 11:39:39 +03:00
|
|
|
fs->fs_bsize, osize, bpp ? *bpp : NULL);
|
|
|
|
ip->i_ffs_size = lblktosize(fs, nb + 1);
|
1998-02-05 10:59:28 +03:00
|
|
|
uvm_vnp_setsize(vp, ip->i_ffs_size);
|
2000-11-27 11:39:39 +03:00
|
|
|
ip->i_ffs_db[nb] = ufs_rw32(newb, needswap);
|
1994-06-08 15:41:58 +04:00
|
|
|
ip->i_flag |= IN_CHANGE | IN_UPDATE;
|
2000-11-27 11:39:39 +03:00
|
|
|
if (bpp) {
|
|
|
|
if (flags & B_SYNC)
|
|
|
|
bwrite(*bpp);
|
|
|
|
else
|
|
|
|
bawrite(*bpp);
|
|
|
|
}
|
1994-06-08 15:41:58 +04:00
|
|
|
}
|
|
|
|
}
|
2000-11-27 11:39:39 +03:00
|
|
|
|
1994-06-08 15:41:58 +04:00
|
|
|
/*
|
|
|
|
* The first NDADDR blocks are direct blocks
|
|
|
|
*/
|
2000-11-27 11:39:39 +03:00
|
|
|
|
1998-03-01 05:20:01 +03:00
|
|
|
if (lbn < NDADDR) {
|
1999-11-15 21:49:07 +03:00
|
|
|
nb = ufs_rw32(ip->i_ffs_db[lbn], needswap);
|
2000-11-27 11:39:39 +03:00
|
|
|
if (nb != 0 && ip->i_ffs_size >= lblktosize(fs, lbn + 1)) {
|
|
|
|
|
|
|
|
/*
|
|
|
|
* The block is an already-allocated direct block
|
|
|
|
* and the file already extends past this block,
|
|
|
|
* thus this must be a whole block.
|
|
|
|
* Just read the block (if requested).
|
|
|
|
*/
|
|
|
|
|
|
|
|
if (bpp != NULL) {
|
|
|
|
error = bread(vp, lbn, fs->fs_bsize, NOCRED,
|
|
|
|
bpp);
|
|
|
|
if (error) {
|
|
|
|
brelse(*bpp);
|
|
|
|
return (error);
|
|
|
|
}
|
1994-06-08 15:41:58 +04:00
|
|
|
}
|
|
|
|
return (0);
|
|
|
|
}
|
|
|
|
if (nb != 0) {
|
2000-11-27 11:39:39 +03:00
|
|
|
|
1994-06-08 15:41:58 +04:00
|
|
|
/*
|
|
|
|
* Consider need to reallocate a fragment.
|
|
|
|
*/
|
2000-11-27 11:39:39 +03:00
|
|
|
|
1997-06-11 14:09:37 +04:00
|
|
|
osize = fragroundup(fs, blkoff(fs, ip->i_ffs_size));
|
1994-06-08 15:41:58 +04:00
|
|
|
nsize = fragroundup(fs, size);
|
|
|
|
if (nsize <= osize) {
|
2000-11-27 11:39:39 +03:00
|
|
|
|
|
|
|
/*
|
|
|
|
* The existing block is already
|
|
|
|
* at least as big as we want.
|
|
|
|
* Just read the block (if requested).
|
|
|
|
*/
|
|
|
|
|
|
|
|
if (bpp != NULL) {
|
|
|
|
error = bread(vp, lbn, osize, NOCRED,
|
|
|
|
bpp);
|
|
|
|
if (error) {
|
|
|
|
brelse(*bpp);
|
|
|
|
return (error);
|
|
|
|
}
|
1994-06-08 15:41:58 +04:00
|
|
|
}
|
2000-11-27 11:39:39 +03:00
|
|
|
return 0;
|
1994-06-08 15:41:58 +04:00
|
|
|
} else {
|
2000-11-27 11:39:39 +03:00
|
|
|
|
|
|
|
/*
|
|
|
|
* The existing block is smaller than we want,
|
|
|
|
* grow it.
|
|
|
|
*/
|
|
|
|
|
1998-03-01 05:20:01 +03:00
|
|
|
error = ffs_realloccg(ip, lbn,
|
|
|
|
ffs_blkpref(ip, lbn, (int)lbn,
|
|
|
|
&ip->i_ffs_db[0]), osize, nsize, cred,
|
2000-11-27 11:39:39 +03:00
|
|
|
bpp, &newb);
|
1994-06-08 15:41:58 +04:00
|
|
|
if (error)
|
|
|
|
return (error);
|
1999-11-15 21:49:07 +03:00
|
|
|
if (DOINGSOFTDEP(vp))
|
|
|
|
softdep_setup_allocdirect(ip, lbn,
|
2000-11-27 11:39:39 +03:00
|
|
|
newb, nb, nsize, osize,
|
|
|
|
bpp ? *bpp : NULL);
|
1994-06-08 15:41:58 +04:00
|
|
|
}
|
|
|
|
} else {
|
2000-11-27 11:39:39 +03:00
|
|
|
|
|
|
|
/*
|
|
|
|
* the block was not previously allocated,
|
|
|
|
* allocate a new block or fragment.
|
|
|
|
*/
|
|
|
|
|
|
|
|
if (ip->i_ffs_size < lblktosize(fs, lbn + 1))
|
1994-06-08 15:41:58 +04:00
|
|
|
nsize = fragroundup(fs, size);
|
|
|
|
else
|
|
|
|
nsize = fs->fs_bsize;
|
1998-03-01 05:20:01 +03:00
|
|
|
error = ffs_alloc(ip, lbn,
|
|
|
|
ffs_blkpref(ip, lbn, (int)lbn, &ip->i_ffs_db[0]),
|
|
|
|
nsize, cred, &newb);
|
1994-06-08 15:41:58 +04:00
|
|
|
if (error)
|
|
|
|
return (error);
|
2000-11-27 11:39:39 +03:00
|
|
|
if (bpp != NULL) {
|
|
|
|
bp = getblk(vp, lbn, nsize, 0, 0);
|
|
|
|
bp->b_blkno = fsbtodb(fs, newb);
|
|
|
|
if (flags & B_CLRBUF)
|
|
|
|
clrbuf(bp);
|
|
|
|
*bpp = bp;
|
|
|
|
}
|
|
|
|
if (DOINGSOFTDEP(vp)) {
|
1999-11-15 21:49:07 +03:00
|
|
|
softdep_setup_allocdirect(ip, lbn, newb, 0,
|
2000-11-27 11:39:39 +03:00
|
|
|
nsize, 0, bpp ? *bpp : NULL);
|
|
|
|
}
|
1994-06-08 15:41:58 +04:00
|
|
|
}
|
2000-11-27 11:39:39 +03:00
|
|
|
ip->i_ffs_db[lbn] = ufs_rw32(newb, needswap);
|
1994-06-08 15:41:58 +04:00
|
|
|
ip->i_flag |= IN_CHANGE | IN_UPDATE;
|
|
|
|
return (0);
|
|
|
|
}
|
2001-11-08 08:27:25 +03:00
|
|
|
|
1994-06-08 15:41:58 +04:00
|
|
|
/*
|
|
|
|
* Determine the number of levels of indirection.
|
|
|
|
*/
|
2001-11-08 08:27:25 +03:00
|
|
|
|
1994-06-08 15:41:58 +04:00
|
|
|
pref = 0;
|
1998-03-01 05:20:01 +03:00
|
|
|
if ((error = ufs_getlbns(vp, lbn, indirs, &num)) != 0)
|
2001-11-08 08:27:25 +03:00
|
|
|
return (error);
|
2000-11-27 11:39:39 +03:00
|
|
|
|
1994-06-08 15:41:58 +04:00
|
|
|
/*
|
|
|
|
* Fetch the first indirect block allocating if necessary.
|
|
|
|
*/
|
2001-11-08 08:27:25 +03:00
|
|
|
|
1994-06-08 15:41:58 +04:00
|
|
|
--num;
|
1999-11-15 21:49:07 +03:00
|
|
|
nb = ufs_rw32(ip->i_ffs_ib[indirs[0].in_off], needswap);
|
1998-03-01 05:20:01 +03:00
|
|
|
allocib = NULL;
|
|
|
|
allocblk = allociblk;
|
1994-06-08 15:41:58 +04:00
|
|
|
if (nb == 0) {
|
1998-03-01 05:20:01 +03:00
|
|
|
pref = ffs_blkpref(ip, lbn, 0, (ufs_daddr_t *)0);
|
2000-05-28 12:15:40 +04:00
|
|
|
error = ffs_alloc(ip, lbn, pref, (int)fs->fs_bsize, cred,
|
|
|
|
&newb);
|
1996-02-10 01:22:18 +03:00
|
|
|
if (error)
|
2001-09-30 06:54:42 +04:00
|
|
|
goto fail;
|
1994-06-08 15:41:58 +04:00
|
|
|
nb = newb;
|
1998-03-01 05:20:01 +03:00
|
|
|
*allocblk++ = nb;
|
1994-06-08 15:41:58 +04:00
|
|
|
bp = getblk(vp, indirs[1].in_lbn, fs->fs_bsize, 0, 0);
|
1998-03-01 05:20:01 +03:00
|
|
|
bp->b_blkno = fsbtodb(fs, nb);
|
1994-06-08 15:41:58 +04:00
|
|
|
clrbuf(bp);
|
1999-11-15 21:49:07 +03:00
|
|
|
if (DOINGSOFTDEP(vp)) {
|
|
|
|
softdep_setup_allocdirect(ip, NDADDR + indirs[0].in_off,
|
|
|
|
newb, 0, fs->fs_bsize, 0, bp);
|
|
|
|
bdwrite(bp);
|
|
|
|
} else {
|
2001-11-08 08:27:25 +03:00
|
|
|
|
1999-11-15 21:49:07 +03:00
|
|
|
/*
|
|
|
|
* Write synchronously so that indirect blocks
|
|
|
|
* never point at garbage.
|
|
|
|
*/
|
2001-11-08 08:27:25 +03:00
|
|
|
|
1999-11-15 21:49:07 +03:00
|
|
|
if ((error = bwrite(bp)) != 0)
|
|
|
|
goto fail;
|
|
|
|
}
|
2000-05-28 12:15:40 +04:00
|
|
|
unwindidx = 0;
|
1998-03-01 05:20:01 +03:00
|
|
|
allocib = &ip->i_ffs_ib[indirs[0].in_off];
|
1999-11-15 21:49:07 +03:00
|
|
|
*allocib = ufs_rw32(nb, needswap);
|
1994-06-08 15:41:58 +04:00
|
|
|
ip->i_flag |= IN_CHANGE | IN_UPDATE;
|
|
|
|
}
|
2001-11-08 08:27:25 +03:00
|
|
|
|
1994-06-08 15:41:58 +04:00
|
|
|
/*
|
|
|
|
* Fetch through the indirect blocks, allocating as necessary.
|
|
|
|
*/
|
2001-11-08 08:27:25 +03:00
|
|
|
|
1994-06-08 15:41:58 +04:00
|
|
|
for (i = 1;;) {
|
|
|
|
error = bread(vp,
|
|
|
|
indirs[i].in_lbn, (int)fs->fs_bsize, NOCRED, &bp);
|
|
|
|
if (error) {
|
|
|
|
brelse(bp);
|
1998-03-01 05:20:01 +03:00
|
|
|
goto fail;
|
1994-06-08 15:41:58 +04:00
|
|
|
}
|
1998-03-01 05:20:01 +03:00
|
|
|
bap = (ufs_daddr_t *)bp->b_data;
|
1999-11-15 21:49:07 +03:00
|
|
|
nb = ufs_rw32(bap[indirs[i].in_off], needswap);
|
1994-06-08 15:41:58 +04:00
|
|
|
if (i == num)
|
|
|
|
break;
|
2000-05-28 12:15:40 +04:00
|
|
|
i++;
|
1994-06-08 15:41:58 +04:00
|
|
|
if (nb != 0) {
|
|
|
|
brelse(bp);
|
|
|
|
continue;
|
|
|
|
}
|
|
|
|
if (pref == 0)
|
1998-03-01 05:20:01 +03:00
|
|
|
pref = ffs_blkpref(ip, lbn, 0, (ufs_daddr_t *)0);
|
1996-02-10 01:22:18 +03:00
|
|
|
error = ffs_alloc(ip, lbn, pref, (int)fs->fs_bsize, cred,
|
2000-05-28 12:15:40 +04:00
|
|
|
&newb);
|
1996-02-10 01:22:18 +03:00
|
|
|
if (error) {
|
1994-06-08 15:41:58 +04:00
|
|
|
brelse(bp);
|
1998-03-01 05:20:01 +03:00
|
|
|
goto fail;
|
1994-06-08 15:41:58 +04:00
|
|
|
}
|
|
|
|
nb = newb;
|
1998-03-01 05:20:01 +03:00
|
|
|
*allocblk++ = nb;
|
1994-06-08 15:41:58 +04:00
|
|
|
nbp = getblk(vp, indirs[i].in_lbn, fs->fs_bsize, 0, 0);
|
|
|
|
nbp->b_blkno = fsbtodb(fs, nb);
|
|
|
|
clrbuf(nbp);
|
1999-11-15 21:49:07 +03:00
|
|
|
if (DOINGSOFTDEP(vp)) {
|
|
|
|
softdep_setup_allocindir_meta(nbp, ip, bp,
|
|
|
|
indirs[i - 1].in_off, nb);
|
|
|
|
bdwrite(nbp);
|
|
|
|
} else {
|
2001-11-08 08:27:25 +03:00
|
|
|
|
1999-11-15 21:49:07 +03:00
|
|
|
/*
|
|
|
|
* Write synchronously so that indirect blocks
|
|
|
|
* never point at garbage.
|
|
|
|
*/
|
2001-11-08 08:27:25 +03:00
|
|
|
|
1999-11-15 21:49:07 +03:00
|
|
|
if ((error = bwrite(nbp)) != 0) {
|
|
|
|
brelse(bp);
|
|
|
|
goto fail;
|
|
|
|
}
|
1994-06-08 15:41:58 +04:00
|
|
|
}
|
2000-05-28 12:15:40 +04:00
|
|
|
if (unwindidx < 0)
|
|
|
|
unwindidx = i - 1;
|
1999-11-15 21:49:07 +03:00
|
|
|
bap[indirs[i - 1].in_off] = ufs_rw32(nb, needswap);
|
2001-11-08 08:27:25 +03:00
|
|
|
|
1994-06-08 15:41:58 +04:00
|
|
|
/*
|
|
|
|
* If required, write synchronously, otherwise use
|
|
|
|
* delayed write.
|
|
|
|
*/
|
2001-11-08 08:27:25 +03:00
|
|
|
|
1994-06-08 15:41:58 +04:00
|
|
|
if (flags & B_SYNC) {
|
|
|
|
bwrite(bp);
|
|
|
|
} else {
|
|
|
|
bdwrite(bp);
|
|
|
|
}
|
|
|
|
}
|
2001-11-08 08:27:25 +03:00
|
|
|
|
1994-06-08 15:41:58 +04:00
|
|
|
/*
|
|
|
|
* Get the data block, allocating if necessary.
|
|
|
|
*/
|
2001-11-08 08:27:25 +03:00
|
|
|
|
1994-06-08 15:41:58 +04:00
|
|
|
if (nb == 0) {
|
2000-05-28 12:31:41 +04:00
|
|
|
pref = ffs_blkpref(ip, lbn, indirs[num].in_off, &bap[0]);
|
1996-02-10 01:22:18 +03:00
|
|
|
error = ffs_alloc(ip, lbn, pref, (int)fs->fs_bsize, cred,
|
2000-05-28 12:15:40 +04:00
|
|
|
&newb);
|
1996-02-10 01:22:18 +03:00
|
|
|
if (error) {
|
1994-06-08 15:41:58 +04:00
|
|
|
brelse(bp);
|
1998-03-01 05:20:01 +03:00
|
|
|
goto fail;
|
1994-06-08 15:41:58 +04:00
|
|
|
}
|
|
|
|
nb = newb;
|
1998-03-01 05:20:01 +03:00
|
|
|
*allocblk++ = nb;
|
2000-11-27 11:39:39 +03:00
|
|
|
if (bpp != NULL) {
|
|
|
|
nbp = getblk(vp, lbn, fs->fs_bsize, 0, 0);
|
|
|
|
nbp->b_blkno = fsbtodb(fs, nb);
|
|
|
|
if (flags & B_CLRBUF)
|
|
|
|
clrbuf(nbp);
|
|
|
|
*bpp = nbp;
|
|
|
|
}
|
1999-11-15 21:49:07 +03:00
|
|
|
if (DOINGSOFTDEP(vp))
|
|
|
|
softdep_setup_allocindir_page(ip, lbn, bp,
|
2000-11-27 11:39:39 +03:00
|
|
|
indirs[num].in_off, nb, 0, bpp ? *bpp : NULL);
|
2000-05-28 12:31:41 +04:00
|
|
|
bap[indirs[num].in_off] = ufs_rw32(nb, needswap);
|
2000-11-27 11:39:39 +03:00
|
|
|
if (allocib == NULL && unwindidx < 0) {
|
|
|
|
unwindidx = i - 1;
|
|
|
|
}
|
2001-11-08 08:27:25 +03:00
|
|
|
|
1994-06-08 15:41:58 +04:00
|
|
|
/*
|
|
|
|
* If required, write synchronously, otherwise use
|
|
|
|
* delayed write.
|
|
|
|
*/
|
2001-11-08 08:27:25 +03:00
|
|
|
|
1994-06-08 15:41:58 +04:00
|
|
|
if (flags & B_SYNC) {
|
|
|
|
bwrite(bp);
|
|
|
|
} else {
|
|
|
|
bdwrite(bp);
|
|
|
|
}
|
|
|
|
return (0);
|
|
|
|
}
|
|
|
|
brelse(bp);
|
2000-11-27 11:39:39 +03:00
|
|
|
if (bpp != NULL) {
|
|
|
|
if (flags & B_CLRBUF) {
|
|
|
|
error = bread(vp, lbn, (int)fs->fs_bsize, NOCRED, &nbp);
|
|
|
|
if (error) {
|
|
|
|
brelse(nbp);
|
|
|
|
goto fail;
|
|
|
|
}
|
|
|
|
} else {
|
|
|
|
nbp = getblk(vp, lbn, fs->fs_bsize, 0, 0);
|
|
|
|
nbp->b_blkno = fsbtodb(fs, nb);
|
|
|
|
clrbuf(nbp);
|
1994-06-08 15:41:58 +04:00
|
|
|
}
|
2000-11-27 11:39:39 +03:00
|
|
|
*bpp = nbp;
|
1994-06-08 15:41:58 +04:00
|
|
|
}
|
|
|
|
return (0);
|
2001-09-30 06:54:42 +04:00
|
|
|
|
1998-03-01 05:20:01 +03:00
|
|
|
fail:
|
2001-09-30 06:54:42 +04:00
|
|
|
/*
|
2001-11-08 08:27:25 +03:00
|
|
|
* If we have failed part way through block allocation, we
|
|
|
|
* have to deallocate any indirect blocks that we have allocated.
|
2001-09-30 06:54:42 +04:00
|
|
|
*/
|
|
|
|
|
2001-11-08 08:27:25 +03:00
|
|
|
if (unwindidx >= 0) {
|
2001-09-30 06:54:42 +04:00
|
|
|
|
2001-11-08 08:27:25 +03:00
|
|
|
/*
|
|
|
|
* First write out any buffers we've created to resolve their
|
|
|
|
* softdeps. This must be done in reverse order of creation
|
|
|
|
* so that we resolve the dependencies in one pass.
|
|
|
|
* Write the cylinder group buffers for these buffers too.
|
|
|
|
*/
|
|
|
|
|
|
|
|
for (i = num; i >= unwindidx; i--) {
|
|
|
|
if (i == 0) {
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
bp = getblk(vp, indirs[i].in_lbn, (int)fs->fs_bsize, 0,
|
|
|
|
0);
|
|
|
|
if (bp->b_flags & B_DELWRI) {
|
|
|
|
nb = fsbtodb(fs, cgtod(fs, dtog(fs,
|
2002-06-05 09:23:51 +04:00
|
|
|
dbtofsb(fs, bp->b_blkno))));
|
2001-11-08 08:27:25 +03:00
|
|
|
bwrite(bp);
|
|
|
|
bp = getblk(ip->i_devvp, nb, (int)fs->fs_cgsize,
|
|
|
|
0, 0);
|
|
|
|
if (bp->b_flags & B_DELWRI) {
|
|
|
|
bwrite(bp);
|
|
|
|
} else {
|
|
|
|
bp->b_flags |= B_INVAL;
|
|
|
|
brelse(bp);
|
|
|
|
}
|
|
|
|
} else {
|
|
|
|
bp->b_flags |= B_INVAL;
|
|
|
|
brelse(bp);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
if (unwindidx == 0) {
|
|
|
|
ip->i_flag |= IN_MODIFIED | IN_CHANGE | IN_UPDATE;
|
|
|
|
VOP_UPDATE(vp, NULL, NULL, UPDATE_WAIT);
|
2001-09-30 06:54:42 +04:00
|
|
|
}
|
|
|
|
|
2001-11-08 08:27:25 +03:00
|
|
|
/*
|
|
|
|
* Now that any dependencies that we created have been
|
|
|
|
* resolved, we can undo the partial allocation.
|
|
|
|
*/
|
2001-09-30 06:54:42 +04:00
|
|
|
|
2000-05-28 12:15:40 +04:00
|
|
|
if (unwindidx == 0) {
|
|
|
|
*allocib = 0;
|
2001-11-08 08:27:25 +03:00
|
|
|
ip->i_flag |= IN_MODIFIED | IN_CHANGE | IN_UPDATE;
|
|
|
|
VOP_UPDATE(vp, NULL, NULL, UPDATE_WAIT);
|
2000-02-25 22:58:25 +03:00
|
|
|
} else {
|
2000-05-28 12:15:40 +04:00
|
|
|
int r;
|
2001-11-08 08:27:25 +03:00
|
|
|
|
|
|
|
r = bread(vp, indirs[unwindidx].in_lbn,
|
2000-05-28 12:15:40 +04:00
|
|
|
(int)fs->fs_bsize, NOCRED, &bp);
|
|
|
|
if (r) {
|
|
|
|
panic("Could not unwind indirect block, error %d", r);
|
|
|
|
brelse(bp);
|
|
|
|
} else {
|
|
|
|
bap = (ufs_daddr_t *)bp->b_data;
|
|
|
|
bap[indirs[unwindidx].in_off] = 0;
|
2001-11-08 08:27:25 +03:00
|
|
|
bwrite(bp);
|
2000-05-28 12:15:40 +04:00
|
|
|
}
|
2000-02-25 22:58:25 +03:00
|
|
|
}
|
2000-05-28 12:31:41 +04:00
|
|
|
for (i = unwindidx + 1; i <= num; i++) {
|
|
|
|
bp = getblk(vp, indirs[i].in_lbn, (int)fs->fs_bsize, 0,
|
|
|
|
0);
|
|
|
|
bp->b_flags |= B_INVAL;
|
|
|
|
brelse(bp);
|
|
|
|
}
|
2000-02-25 22:58:25 +03:00
|
|
|
}
|
2001-11-08 08:27:25 +03:00
|
|
|
for (deallocated = 0, blkp = allociblk; blkp < allocblk; blkp++) {
|
|
|
|
ffs_blkfree(ip, *blkp, fs->fs_bsize);
|
|
|
|
deallocated += fs->fs_bsize;
|
|
|
|
}
|
1998-03-01 05:20:01 +03:00
|
|
|
if (deallocated) {
|
|
|
|
#ifdef QUOTA
|
|
|
|
/*
|
|
|
|
* Restore user's disk quota because allocation failed.
|
|
|
|
*/
|
|
|
|
(void)chkdq(ip, (long)-btodb(deallocated), cred, FORCE);
|
|
|
|
#endif
|
|
|
|
ip->i_ffs_blocks -= btodb(deallocated);
|
1998-10-28 00:32:58 +03:00
|
|
|
ip->i_flag |= IN_CHANGE | IN_UPDATE;
|
1998-03-01 05:20:01 +03:00
|
|
|
}
|
|
|
|
return (error);
|
1994-06-08 15:41:58 +04:00
|
|
|
}
|
2000-11-27 11:39:39 +03:00
|
|
|
|
|
|
|
|
|
|
|
int
|
a whole bunch of changes to improve performance and robustness under load:
- remove special treatment of pager_map mappings in pmaps. this is
required now, since I've removed the globals that expose the address range.
pager_map now uses pmap_kenter_pa() instead of pmap_enter(), so there's
no longer any need to special-case it.
- eliminate struct uvm_vnode by moving its fields into struct vnode.
- rewrite the pageout path. the pager is now responsible for handling the
high-level requests instead of only getting control after a bunch of work
has already been done on its behalf. this will allow us to UBCify LFS,
which needs tighter control over its pages than other filesystems do.
writing a page to disk no longer requires making it read-only, which
allows us to write wired pages without causing all kinds of havoc.
- use a new PG_PAGEOUT flag to indicate that a page should be freed
on behalf of the pagedaemon when it's unlocked. this flag is very similar
to PG_RELEASED, but unlike PG_RELEASED, PG_PAGEOUT can be cleared if the
pageout fails due to eg. an indirect-block buffer being locked.
this allows us to remove the "version" field from struct vm_page,
and together with shrinking "loan_count" from 32 bits to 16,
struct vm_page is now 4 bytes smaller.
- no longer use PG_RELEASED for swap-backed pages. if the page is busy
because it's being paged out, we can't release the swap slot to be
reallocated until that write is complete, but unlike with vnodes we
don't keep a count of in-progress writes so there's no good way to
know when the write is done. instead, when we need to free a busy
swap-backed page, just sleep until we can get it busy ourselves.
- implement a fast-path for extending writes which allows us to avoid
zeroing new pages. this substantially reduces cpu usage.
- encapsulate the data used by the genfs code in a struct genfs_node,
which must be the first element of the filesystem-specific vnode data
for filesystems which use genfs_{get,put}pages().
- eliminate many of the UVM pagerops, since they aren't needed anymore
now that the pager "put" operation is a higher-level operation.
- enhance the genfs code to allow NFS to use the genfs_{get,put}pages
instead of a modified copy.
- clean up struct vnode by removing all the fields that used to be used by
the vfs_cluster.c code (which we don't use anymore with UBC).
- remove kmem_object and mb_object since they were useless.
instead of allocating pages to these objects, we now just allocate
pages with no object. such pages are mapped in the kernel until they
are freed, so we can use the mapping to find the page to free it.
this allows us to remove splvm() protection in several places.
The sum of all these changes improves write throughput on my
decstation 5000/200 to within 1% of the rate of NetBSD 1.5
and reduces the elapsed time for "make release" of a NetBSD 1.5
source tree on my 128MB pc to 10% less than a 1.5 kernel took.
2001-09-16 00:36:31 +04:00
|
|
|
ffs_gop_alloc(struct vnode *vp, off_t off, off_t len, int flags,
|
|
|
|
struct ucred *cred)
|
2000-11-27 11:39:39 +03:00
|
|
|
{
|
|
|
|
struct inode *ip = VTOI(vp);
|
|
|
|
struct fs *fs = ip->i_fs;
|
|
|
|
int error, delta, bshift, bsize;
|
a whole bunch of changes to improve performance and robustness under load:
- remove special treatment of pager_map mappings in pmaps. this is
required now, since I've removed the globals that expose the address range.
pager_map now uses pmap_kenter_pa() instead of pmap_enter(), so there's
no longer any need to special-case it.
- eliminate struct uvm_vnode by moving its fields into struct vnode.
- rewrite the pageout path. the pager is now responsible for handling the
high-level requests instead of only getting control after a bunch of work
has already been done on its behalf. this will allow us to UBCify LFS,
which needs tighter control over its pages than other filesystems do.
writing a page to disk no longer requires making it read-only, which
allows us to write wired pages without causing all kinds of havoc.
- use a new PG_PAGEOUT flag to indicate that a page should be freed
on behalf of the pagedaemon when it's unlocked. this flag is very similar
to PG_RELEASED, but unlike PG_RELEASED, PG_PAGEOUT can be cleared if the
pageout fails due to eg. an indirect-block buffer being locked.
this allows us to remove the "version" field from struct vm_page,
and together with shrinking "loan_count" from 32 bits to 16,
struct vm_page is now 4 bytes smaller.
- no longer use PG_RELEASED for swap-backed pages. if the page is busy
because it's being paged out, we can't release the swap slot to be
reallocated until that write is complete, but unlike with vnodes we
don't keep a count of in-progress writes so there's no good way to
know when the write is done. instead, when we need to free a busy
swap-backed page, just sleep until we can get it busy ourselves.
- implement a fast-path for extending writes which allows us to avoid
zeroing new pages. this substantially reduces cpu usage.
- encapsulate the data used by the genfs code in a struct genfs_node,
which must be the first element of the filesystem-specific vnode data
for filesystems which use genfs_{get,put}pages().
- eliminate many of the UVM pagerops, since they aren't needed anymore
now that the pager "put" operation is a higher-level operation.
- enhance the genfs code to allow NFS to use the genfs_{get,put}pages
instead of a modified copy.
- clean up struct vnode by removing all the fields that used to be used by
the vfs_cluster.c code (which we don't use anymore with UBC).
- remove kmem_object and mb_object since they were useless.
instead of allocating pages to these objects, we now just allocate
pages with no object. such pages are mapped in the kernel until they
are freed, so we can use the mapping to find the page to free it.
this allows us to remove splvm() protection in several places.
The sum of all these changes improves write throughput on my
decstation 5000/200 to within 1% of the rate of NetBSD 1.5
and reduces the elapsed time for "make release" of a NetBSD 1.5
source tree on my 128MB pc to 10% less than a 1.5 kernel took.
2001-09-16 00:36:31 +04:00
|
|
|
UVMHIST_FUNC("ffs_gop_alloc"); UVMHIST_CALLED(ubchist);
|
2000-11-27 11:39:39 +03:00
|
|
|
|
|
|
|
error = 0;
|
|
|
|
bshift = fs->fs_bshift;
|
|
|
|
bsize = 1 << bshift;
|
|
|
|
|
|
|
|
delta = off & (bsize - 1);
|
|
|
|
off -= delta;
|
|
|
|
len += delta;
|
|
|
|
|
|
|
|
while (len > 0) {
|
a whole bunch of changes to improve performance and robustness under load:
- remove special treatment of pager_map mappings in pmaps. this is
required now, since I've removed the globals that expose the address range.
pager_map now uses pmap_kenter_pa() instead of pmap_enter(), so there's
no longer any need to special-case it.
- eliminate struct uvm_vnode by moving its fields into struct vnode.
- rewrite the pageout path. the pager is now responsible for handling the
high-level requests instead of only getting control after a bunch of work
has already been done on its behalf. this will allow us to UBCify LFS,
which needs tighter control over its pages than other filesystems do.
writing a page to disk no longer requires making it read-only, which
allows us to write wired pages without causing all kinds of havoc.
- use a new PG_PAGEOUT flag to indicate that a page should be freed
on behalf of the pagedaemon when it's unlocked. this flag is very similar
to PG_RELEASED, but unlike PG_RELEASED, PG_PAGEOUT can be cleared if the
pageout fails due to eg. an indirect-block buffer being locked.
this allows us to remove the "version" field from struct vm_page,
and together with shrinking "loan_count" from 32 bits to 16,
struct vm_page is now 4 bytes smaller.
- no longer use PG_RELEASED for swap-backed pages. if the page is busy
because it's being paged out, we can't release the swap slot to be
reallocated until that write is complete, but unlike with vnodes we
don't keep a count of in-progress writes so there's no good way to
know when the write is done. instead, when we need to free a busy
swap-backed page, just sleep until we can get it busy ourselves.
- implement a fast-path for extending writes which allows us to avoid
zeroing new pages. this substantially reduces cpu usage.
- encapsulate the data used by the genfs code in a struct genfs_node,
which must be the first element of the filesystem-specific vnode data
for filesystems which use genfs_{get,put}pages().
- eliminate many of the UVM pagerops, since they aren't needed anymore
now that the pager "put" operation is a higher-level operation.
- enhance the genfs code to allow NFS to use the genfs_{get,put}pages
instead of a modified copy.
- clean up struct vnode by removing all the fields that used to be used by
the vfs_cluster.c code (which we don't use anymore with UBC).
- remove kmem_object and mb_object since they were useless.
instead of allocating pages to these objects, we now just allocate
pages with no object. such pages are mapped in the kernel until they
are freed, so we can use the mapping to find the page to free it.
this allows us to remove splvm() protection in several places.
The sum of all these changes improves write throughput on my
decstation 5000/200 to within 1% of the rate of NetBSD 1.5
and reduces the elapsed time for "make release" of a NetBSD 1.5
source tree on my 128MB pc to 10% less than a 1.5 kernel took.
2001-09-16 00:36:31 +04:00
|
|
|
bsize = MIN(bsize, len);
|
2000-11-27 11:39:39 +03:00
|
|
|
|
a whole bunch of changes to improve performance and robustness under load:
- remove special treatment of pager_map mappings in pmaps. this is
required now, since I've removed the globals that expose the address range.
pager_map now uses pmap_kenter_pa() instead of pmap_enter(), so there's
no longer any need to special-case it.
- eliminate struct uvm_vnode by moving its fields into struct vnode.
- rewrite the pageout path. the pager is now responsible for handling the
high-level requests instead of only getting control after a bunch of work
has already been done on its behalf. this will allow us to UBCify LFS,
which needs tighter control over its pages than other filesystems do.
writing a page to disk no longer requires making it read-only, which
allows us to write wired pages without causing all kinds of havoc.
- use a new PG_PAGEOUT flag to indicate that a page should be freed
on behalf of the pagedaemon when it's unlocked. this flag is very similar
to PG_RELEASED, but unlike PG_RELEASED, PG_PAGEOUT can be cleared if the
pageout fails due to eg. an indirect-block buffer being locked.
this allows us to remove the "version" field from struct vm_page,
and together with shrinking "loan_count" from 32 bits to 16,
struct vm_page is now 4 bytes smaller.
- no longer use PG_RELEASED for swap-backed pages. if the page is busy
because it's being paged out, we can't release the swap slot to be
reallocated until that write is complete, but unlike with vnodes we
don't keep a count of in-progress writes so there's no good way to
know when the write is done. instead, when we need to free a busy
swap-backed page, just sleep until we can get it busy ourselves.
- implement a fast-path for extending writes which allows us to avoid
zeroing new pages. this substantially reduces cpu usage.
- encapsulate the data used by the genfs code in a struct genfs_node,
which must be the first element of the filesystem-specific vnode data
for filesystems which use genfs_{get,put}pages().
- eliminate many of the UVM pagerops, since they aren't needed anymore
now that the pager "put" operation is a higher-level operation.
- enhance the genfs code to allow NFS to use the genfs_{get,put}pages
instead of a modified copy.
- clean up struct vnode by removing all the fields that used to be used by
the vfs_cluster.c code (which we don't use anymore with UBC).
- remove kmem_object and mb_object since they were useless.
instead of allocating pages to these objects, we now just allocate
pages with no object. such pages are mapped in the kernel until they
are freed, so we can use the mapping to find the page to free it.
this allows us to remove splvm() protection in several places.
The sum of all these changes improves write throughput on my
decstation 5000/200 to within 1% of the rate of NetBSD 1.5
and reduces the elapsed time for "make release" of a NetBSD 1.5
source tree on my 128MB pc to 10% less than a 1.5 kernel took.
2001-09-16 00:36:31 +04:00
|
|
|
error = VOP_BALLOC(vp, off, bsize, cred, flags, NULL);
|
2000-11-27 11:39:39 +03:00
|
|
|
if (error) {
|
|
|
|
goto out;
|
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* increase file size now, VOP_BALLOC() requires that
|
|
|
|
* EOF be up-to-date before each call.
|
|
|
|
*/
|
|
|
|
|
|
|
|
if (ip->i_ffs_size < off + bsize) {
|
a whole bunch of changes to improve performance and robustness under load:
- remove special treatment of pager_map mappings in pmaps. this is
required now, since I've removed the globals that expose the address range.
pager_map now uses pmap_kenter_pa() instead of pmap_enter(), so there's
no longer any need to special-case it.
- eliminate struct uvm_vnode by moving its fields into struct vnode.
- rewrite the pageout path. the pager is now responsible for handling the
high-level requests instead of only getting control after a bunch of work
has already been done on its behalf. this will allow us to UBCify LFS,
which needs tighter control over its pages than other filesystems do.
writing a page to disk no longer requires making it read-only, which
allows us to write wired pages without causing all kinds of havoc.
- use a new PG_PAGEOUT flag to indicate that a page should be freed
on behalf of the pagedaemon when it's unlocked. this flag is very similar
to PG_RELEASED, but unlike PG_RELEASED, PG_PAGEOUT can be cleared if the
pageout fails due to eg. an indirect-block buffer being locked.
this allows us to remove the "version" field from struct vm_page,
and together with shrinking "loan_count" from 32 bits to 16,
struct vm_page is now 4 bytes smaller.
- no longer use PG_RELEASED for swap-backed pages. if the page is busy
because it's being paged out, we can't release the swap slot to be
reallocated until that write is complete, but unlike with vnodes we
don't keep a count of in-progress writes so there's no good way to
know when the write is done. instead, when we need to free a busy
swap-backed page, just sleep until we can get it busy ourselves.
- implement a fast-path for extending writes which allows us to avoid
zeroing new pages. this substantially reduces cpu usage.
- encapsulate the data used by the genfs code in a struct genfs_node,
which must be the first element of the filesystem-specific vnode data
for filesystems which use genfs_{get,put}pages().
- eliminate many of the UVM pagerops, since they aren't needed anymore
now that the pager "put" operation is a higher-level operation.
- enhance the genfs code to allow NFS to use the genfs_{get,put}pages
instead of a modified copy.
- clean up struct vnode by removing all the fields that used to be used by
the vfs_cluster.c code (which we don't use anymore with UBC).
- remove kmem_object and mb_object since they were useless.
instead of allocating pages to these objects, we now just allocate
pages with no object. such pages are mapped in the kernel until they
are freed, so we can use the mapping to find the page to free it.
this allows us to remove splvm() protection in several places.
The sum of all these changes improves write throughput on my
decstation 5000/200 to within 1% of the rate of NetBSD 1.5
and reduces the elapsed time for "make release" of a NetBSD 1.5
source tree on my 128MB pc to 10% less than a 1.5 kernel took.
2001-09-16 00:36:31 +04:00
|
|
|
UVMHIST_LOG(ubchist, "vp %p old 0x%x new 0x%x",
|
|
|
|
vp, ip->i_ffs_size, off + bsize, 0);
|
2000-11-27 11:39:39 +03:00
|
|
|
ip->i_ffs_size = off + bsize;
|
|
|
|
}
|
|
|
|
|
|
|
|
off += bsize;
|
|
|
|
len -= bsize;
|
|
|
|
}
|
|
|
|
|
|
|
|
out:
|
|
|
|
return error;
|
|
|
|
}
|