1994-05-24 10:09:53 +00: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.
|
|
|
|
*
|
1997-02-10 02:22:35 +00:00
|
|
|
* @(#)ffs_balloc.c 8.8 (Berkeley) 6/16/95
|
1999-08-28 01:08:13 +00:00
|
|
|
* $FreeBSD$
|
1994-05-24 10:09:53 +00:00
|
|
|
*/
|
|
|
|
|
|
|
|
#include <sys/param.h>
|
|
|
|
#include <sys/systm.h>
|
|
|
|
#include <sys/buf.h>
|
1997-12-05 19:55:52 +00:00
|
|
|
#include <sys/lock.h>
|
1998-03-08 09:59:44 +00:00
|
|
|
#include <sys/mount.h>
|
1994-05-24 10:09:53 +00:00
|
|
|
#include <sys/vnode.h>
|
|
|
|
|
|
|
|
#include <ufs/ufs/quota.h>
|
|
|
|
#include <ufs/ufs/inode.h>
|
|
|
|
#include <ufs/ufs/ufs_extern.h>
|
|
|
|
|
|
|
|
#include <ufs/ffs/fs.h>
|
|
|
|
#include <ufs/ffs/ffs_extern.h>
|
|
|
|
|
|
|
|
/*
|
|
|
|
* 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.
|
|
|
|
*/
|
1994-05-25 09:21:21 +00:00
|
|
|
int
|
1998-03-08 09:59:44 +00:00
|
|
|
ffs_balloc(ap)
|
|
|
|
struct vop_balloc_args /* {
|
2000-01-11 08:27:00 +00:00
|
|
|
struct vnode *a_vp;
|
1998-03-08 09:59:44 +00:00
|
|
|
ufs_daddr_t a_lbn;
|
|
|
|
int a_size;
|
|
|
|
struct ucred *a_cred;
|
|
|
|
int a_flags;
|
|
|
|
struct buf *a_bpp;
|
|
|
|
} */ *ap;
|
|
|
|
{
|
2000-01-11 08:27:00 +00:00
|
|
|
struct inode *ip;
|
|
|
|
ufs_daddr_t lbn;
|
1994-05-24 10:09:53 +00:00
|
|
|
int size;
|
|
|
|
struct ucred *cred;
|
|
|
|
int flags;
|
1998-03-08 09:59:44 +00:00
|
|
|
struct fs *fs;
|
|
|
|
ufs_daddr_t nb;
|
1994-05-24 10:09:53 +00:00
|
|
|
struct buf *bp, *nbp;
|
1998-09-12 14:46:15 +00:00
|
|
|
struct vnode *vp;
|
1994-05-24 10:09:53 +00:00
|
|
|
struct indir indirs[NIADDR + 2];
|
1997-02-10 02:22:35 +00:00
|
|
|
ufs_daddr_t newb, *bap, pref;
|
|
|
|
int deallocated, osize, nsize, num, i, error;
|
|
|
|
ufs_daddr_t *allocib, *blkp, *allocblk, allociblk[NIADDR + 1];
|
2000-01-11 08:27:00 +00:00
|
|
|
struct proc *p = curproc; /* XXX */
|
1994-05-24 10:09:53 +00:00
|
|
|
|
1998-03-08 09:59:44 +00:00
|
|
|
vp = ap->a_vp;
|
|
|
|
ip = VTOI(vp);
|
|
|
|
fs = ip->i_fs;
|
|
|
|
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");
|
|
|
|
*ap->a_bpp = NULL;
|
1997-02-10 02:22:35 +00:00
|
|
|
if (lbn < 0)
|
1994-05-24 10:09:53 +00:00
|
|
|
return (EFBIG);
|
1998-03-08 09:59:44 +00:00
|
|
|
cred = ap->a_cred;
|
|
|
|
flags = ap->a_flags;
|
1994-05-24 10:09:53 +00: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.
|
|
|
|
*/
|
|
|
|
nb = lblkno(fs, ip->i_size);
|
1997-02-10 02:22:35 +00:00
|
|
|
if (nb < NDADDR && nb < lbn) {
|
1994-05-24 10:09:53 +00:00
|
|
|
osize = blksize(fs, ip, nb);
|
|
|
|
if (osize < fs->fs_bsize && osize > 0) {
|
|
|
|
error = ffs_realloccg(ip, nb,
|
|
|
|
ffs_blkpref(ip, nb, (int)nb, &ip->i_db[0]),
|
|
|
|
osize, (int)fs->fs_bsize, cred, &bp);
|
|
|
|
if (error)
|
|
|
|
return (error);
|
1998-03-08 09:59:44 +00:00
|
|
|
if (DOINGSOFTDEP(vp))
|
|
|
|
softdep_setup_allocdirect(ip, nb,
|
|
|
|
dbtofsb(fs, bp->b_blkno), ip->i_db[nb],
|
|
|
|
fs->fs_bsize, osize, bp);
|
1997-04-10 13:17:09 +00:00
|
|
|
ip->i_size = smalllblktosize(fs, nb + 1);
|
1994-05-24 10:09:53 +00:00
|
|
|
ip->i_db[nb] = dbtofsb(fs, bp->b_blkno);
|
|
|
|
ip->i_flag |= IN_CHANGE | IN_UPDATE;
|
|
|
|
if (flags & B_SYNC)
|
|
|
|
bwrite(bp);
|
|
|
|
else
|
|
|
|
bawrite(bp);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
/*
|
|
|
|
* The first NDADDR blocks are direct blocks
|
|
|
|
*/
|
1997-02-10 02:22:35 +00:00
|
|
|
if (lbn < NDADDR) {
|
|
|
|
nb = ip->i_db[lbn];
|
1997-04-10 13:17:09 +00:00
|
|
|
if (nb != 0 && ip->i_size >= smalllblktosize(fs, lbn + 1)) {
|
1997-02-10 02:22:35 +00:00
|
|
|
error = bread(vp, lbn, fs->fs_bsize, NOCRED, &bp);
|
1994-05-24 10:09:53 +00:00
|
|
|
if (error) {
|
|
|
|
brelse(bp);
|
|
|
|
return (error);
|
|
|
|
}
|
1995-03-03 22:13:16 +00:00
|
|
|
bp->b_blkno = fsbtodb(fs, nb);
|
1998-03-08 09:59:44 +00:00
|
|
|
*ap->a_bpp = bp;
|
1994-05-24 10:09:53 +00:00
|
|
|
return (0);
|
|
|
|
}
|
|
|
|
if (nb != 0) {
|
|
|
|
/*
|
|
|
|
* Consider need to reallocate a fragment.
|
|
|
|
*/
|
|
|
|
osize = fragroundup(fs, blkoff(fs, ip->i_size));
|
|
|
|
nsize = fragroundup(fs, size);
|
|
|
|
if (nsize <= osize) {
|
1997-02-10 02:22:35 +00:00
|
|
|
error = bread(vp, lbn, osize, NOCRED, &bp);
|
1994-05-24 10:09:53 +00:00
|
|
|
if (error) {
|
|
|
|
brelse(bp);
|
|
|
|
return (error);
|
|
|
|
}
|
1995-03-03 22:13:16 +00:00
|
|
|
bp->b_blkno = fsbtodb(fs, nb);
|
1994-05-24 10:09:53 +00:00
|
|
|
} else {
|
1997-02-10 02:22:35 +00:00
|
|
|
error = ffs_realloccg(ip, lbn,
|
|
|
|
ffs_blkpref(ip, lbn, (int)lbn,
|
|
|
|
&ip->i_db[0]), osize, nsize, cred, &bp);
|
1994-05-24 10:09:53 +00:00
|
|
|
if (error)
|
|
|
|
return (error);
|
1998-03-08 09:59:44 +00:00
|
|
|
if (DOINGSOFTDEP(vp))
|
|
|
|
softdep_setup_allocdirect(ip, lbn,
|
|
|
|
dbtofsb(fs, bp->b_blkno), nb,
|
|
|
|
nsize, osize, bp);
|
1994-05-24 10:09:53 +00:00
|
|
|
}
|
|
|
|
} else {
|
1997-04-10 13:17:09 +00:00
|
|
|
if (ip->i_size < smalllblktosize(fs, lbn + 1))
|
1994-05-24 10:09:53 +00:00
|
|
|
nsize = fragroundup(fs, size);
|
|
|
|
else
|
|
|
|
nsize = fs->fs_bsize;
|
1997-02-10 02:22:35 +00:00
|
|
|
error = ffs_alloc(ip, lbn,
|
|
|
|
ffs_blkpref(ip, lbn, (int)lbn, &ip->i_db[0]),
|
1994-05-24 10:09:53 +00:00
|
|
|
nsize, cred, &newb);
|
|
|
|
if (error)
|
|
|
|
return (error);
|
1997-02-10 02:22:35 +00:00
|
|
|
bp = getblk(vp, lbn, nsize, 0, 0);
|
1994-05-24 10:09:53 +00:00
|
|
|
bp->b_blkno = fsbtodb(fs, newb);
|
|
|
|
if (flags & B_CLRBUF)
|
1995-04-09 06:03:56 +00:00
|
|
|
vfs_bio_clrbuf(bp);
|
1998-03-08 09:59:44 +00:00
|
|
|
if (DOINGSOFTDEP(vp))
|
|
|
|
softdep_setup_allocdirect(ip, lbn, newb, 0,
|
|
|
|
nsize, 0, bp);
|
1994-05-24 10:09:53 +00:00
|
|
|
}
|
1997-02-10 02:22:35 +00:00
|
|
|
ip->i_db[lbn] = dbtofsb(fs, bp->b_blkno);
|
1994-05-24 10:09:53 +00:00
|
|
|
ip->i_flag |= IN_CHANGE | IN_UPDATE;
|
1998-03-08 09:59:44 +00:00
|
|
|
*ap->a_bpp = bp;
|
1994-05-24 10:09:53 +00:00
|
|
|
return (0);
|
|
|
|
}
|
|
|
|
/*
|
|
|
|
* Determine the number of levels of indirection.
|
|
|
|
*/
|
|
|
|
pref = 0;
|
1999-01-28 00:57:57 +00:00
|
|
|
if ((error = ufs_getlbns(vp, lbn, indirs, &num)) != 0)
|
1994-05-24 10:09:53 +00:00
|
|
|
return(error);
|
|
|
|
#ifdef DIAGNOSTIC
|
|
|
|
if (num < 1)
|
1995-03-19 14:29:26 +00:00
|
|
|
panic ("ffs_balloc: ufs_bmaparray returned indirect block");
|
1994-05-24 10:09:53 +00:00
|
|
|
#endif
|
|
|
|
/*
|
|
|
|
* Fetch the first indirect block allocating if necessary.
|
|
|
|
*/
|
|
|
|
--num;
|
|
|
|
nb = ip->i_ib[indirs[0].in_off];
|
1997-02-10 02:22:35 +00:00
|
|
|
allocib = NULL;
|
|
|
|
allocblk = allociblk;
|
1994-05-24 10:09:53 +00:00
|
|
|
if (nb == 0) {
|
1997-02-10 02:22:35 +00:00
|
|
|
pref = ffs_blkpref(ip, lbn, 0, (ufs_daddr_t *)0);
|
1999-01-28 00:57:57 +00:00
|
|
|
if ((error = ffs_alloc(ip, lbn, pref, (int)fs->fs_bsize,
|
|
|
|
cred, &newb)) != 0)
|
1994-05-24 10:09:53 +00:00
|
|
|
return (error);
|
|
|
|
nb = newb;
|
1997-02-10 02:22:35 +00:00
|
|
|
*allocblk++ = nb;
|
1994-05-24 10:09:53 +00:00
|
|
|
bp = getblk(vp, indirs[1].in_lbn, fs->fs_bsize, 0, 0);
|
1997-02-10 02:22:35 +00:00
|
|
|
bp->b_blkno = fsbtodb(fs, nb);
|
1995-04-09 06:03:56 +00:00
|
|
|
vfs_bio_clrbuf(bp);
|
1998-03-08 09:59:44 +00:00
|
|
|
if (DOINGSOFTDEP(vp)) {
|
|
|
|
softdep_setup_allocdirect(ip, NDADDR + indirs[0].in_off,
|
|
|
|
newb, 0, fs->fs_bsize, 0, bp);
|
|
|
|
bdwrite(bp);
|
|
|
|
} else {
|
|
|
|
/*
|
|
|
|
* Write synchronously so that indirect blocks
|
|
|
|
* never point at garbage.
|
|
|
|
*/
|
1999-07-13 18:20:13 +00:00
|
|
|
if (DOINGASYNC(vp))
|
|
|
|
bdwrite(bp);
|
|
|
|
else if ((error = bwrite(bp)) != 0)
|
1998-03-08 09:59:44 +00:00
|
|
|
goto fail;
|
|
|
|
}
|
1997-02-10 02:22:35 +00:00
|
|
|
allocib = &ip->i_ib[indirs[0].in_off];
|
|
|
|
*allocib = nb;
|
1994-05-24 10:09:53 +00:00
|
|
|
ip->i_flag |= IN_CHANGE | IN_UPDATE;
|
|
|
|
}
|
|
|
|
/*
|
|
|
|
* Fetch through the indirect blocks, allocating as necessary.
|
|
|
|
*/
|
|
|
|
for (i = 1;;) {
|
|
|
|
error = bread(vp,
|
|
|
|
indirs[i].in_lbn, (int)fs->fs_bsize, NOCRED, &bp);
|
|
|
|
if (error) {
|
|
|
|
brelse(bp);
|
1997-02-10 02:22:35 +00:00
|
|
|
goto fail;
|
1994-05-24 10:09:53 +00:00
|
|
|
}
|
1997-02-10 02:22:35 +00:00
|
|
|
bap = (ufs_daddr_t *)bp->b_data;
|
1994-05-24 10:09:53 +00:00
|
|
|
nb = bap[indirs[i].in_off];
|
|
|
|
if (i == num)
|
|
|
|
break;
|
|
|
|
i += 1;
|
|
|
|
if (nb != 0) {
|
1996-01-19 04:00:31 +00:00
|
|
|
bqrelse(bp);
|
1994-05-24 10:09:53 +00:00
|
|
|
continue;
|
|
|
|
}
|
|
|
|
if (pref == 0)
|
1997-02-10 02:22:35 +00:00
|
|
|
pref = ffs_blkpref(ip, lbn, 0, (ufs_daddr_t *)0);
|
1999-01-28 00:57:57 +00:00
|
|
|
if ((error =
|
|
|
|
ffs_alloc(ip, lbn, pref, (int)fs->fs_bsize, cred, &newb)) != 0) {
|
1994-05-24 10:09:53 +00:00
|
|
|
brelse(bp);
|
1997-02-10 02:22:35 +00:00
|
|
|
goto fail;
|
1994-05-24 10:09:53 +00:00
|
|
|
}
|
|
|
|
nb = newb;
|
1997-02-10 02:22:35 +00:00
|
|
|
*allocblk++ = nb;
|
1994-05-24 10:09:53 +00:00
|
|
|
nbp = getblk(vp, indirs[i].in_lbn, fs->fs_bsize, 0, 0);
|
|
|
|
nbp->b_blkno = fsbtodb(fs, nb);
|
1995-04-09 06:03:56 +00:00
|
|
|
vfs_bio_clrbuf(nbp);
|
1998-03-08 09:59:44 +00:00
|
|
|
if (DOINGSOFTDEP(vp)) {
|
|
|
|
softdep_setup_allocindir_meta(nbp, ip, bp,
|
|
|
|
indirs[i - 1].in_off, nb);
|
|
|
|
bdwrite(nbp);
|
|
|
|
} else {
|
|
|
|
/*
|
|
|
|
* Write synchronously so that indirect blocks
|
|
|
|
* never point at garbage.
|
|
|
|
*/
|
1999-01-28 00:57:57 +00:00
|
|
|
if ((error = bwrite(nbp)) != 0) {
|
1998-03-08 09:59:44 +00:00
|
|
|
brelse(bp);
|
|
|
|
goto fail;
|
|
|
|
}
|
1994-05-24 10:09:53 +00:00
|
|
|
}
|
|
|
|
bap[indirs[i - 1].in_off] = nb;
|
|
|
|
/*
|
|
|
|
* If required, write synchronously, otherwise use
|
|
|
|
* delayed write.
|
|
|
|
*/
|
|
|
|
if (flags & B_SYNC) {
|
|
|
|
bwrite(bp);
|
|
|
|
} else {
|
Make our v_usecount vnode reference count work identically to the
original BSD code. The association between the vnode and the vm_object
no longer includes reference counts. The major difference is that
vm_object's are no longer freed gratuitiously from the vnode, and so
once an object is created for the vnode, it will last as long as the
vnode does.
When a vnode object reference count is incremented, then the underlying
vnode reference count is incremented also. The two "objects" are now
more intimately related, and so the interactions are now much less
complex.
When vnodes are now normally placed onto the free queue with an object still
attached. The rundown of the object happens at vnode rundown time, and
happens with exactly the same filesystem semantics of the original VFS
code. There is absolutely no need for vnode_pager_uncache and other
travesties like that anymore.
A side-effect of these changes is that SMP locking should be much simpler,
the I/O copyin/copyout optimizations work, NFS should be more ponderable,
and further work on layered filesystems should be less frustrating, because
of the totally coherent management of the vnode objects and vnodes.
Please be careful with your system while running this code, but I would
greatly appreciate feedback as soon a reasonably possible.
1998-01-06 05:26:17 +00:00
|
|
|
if (bp->b_bufsize == fs->fs_bsize)
|
|
|
|
bp->b_flags |= B_CLUSTEROK;
|
1994-05-24 10:09:53 +00:00
|
|
|
bdwrite(bp);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
/*
|
|
|
|
* Get the data block, allocating if necessary.
|
|
|
|
*/
|
|
|
|
if (nb == 0) {
|
|
|
|
pref = ffs_blkpref(ip, lbn, indirs[i].in_off, &bap[0]);
|
1994-10-10 01:04:55 +00:00
|
|
|
error = ffs_alloc(ip,
|
|
|
|
lbn, pref, (int)fs->fs_bsize, cred, &newb);
|
|
|
|
if (error) {
|
1994-05-24 10:09:53 +00:00
|
|
|
brelse(bp);
|
1997-02-10 02:22:35 +00:00
|
|
|
goto fail;
|
1994-05-24 10:09:53 +00:00
|
|
|
}
|
|
|
|
nb = newb;
|
1997-02-10 02:22:35 +00:00
|
|
|
*allocblk++ = nb;
|
1994-05-24 10:09:53 +00:00
|
|
|
nbp = getblk(vp, lbn, fs->fs_bsize, 0, 0);
|
|
|
|
nbp->b_blkno = fsbtodb(fs, nb);
|
|
|
|
if (flags & B_CLRBUF)
|
1995-04-09 06:03:56 +00:00
|
|
|
vfs_bio_clrbuf(nbp);
|
1998-03-08 09:59:44 +00:00
|
|
|
if (DOINGSOFTDEP(vp))
|
|
|
|
softdep_setup_allocindir_page(ip, lbn, bp,
|
|
|
|
indirs[i].in_off, nb, 0, nbp);
|
1994-05-24 10:09:53 +00:00
|
|
|
bap[indirs[i].in_off] = nb;
|
|
|
|
/*
|
|
|
|
* If required, write synchronously, otherwise use
|
|
|
|
* delayed write.
|
|
|
|
*/
|
|
|
|
if (flags & B_SYNC) {
|
|
|
|
bwrite(bp);
|
|
|
|
} else {
|
Make our v_usecount vnode reference count work identically to the
original BSD code. The association between the vnode and the vm_object
no longer includes reference counts. The major difference is that
vm_object's are no longer freed gratuitiously from the vnode, and so
once an object is created for the vnode, it will last as long as the
vnode does.
When a vnode object reference count is incremented, then the underlying
vnode reference count is incremented also. The two "objects" are now
more intimately related, and so the interactions are now much less
complex.
When vnodes are now normally placed onto the free queue with an object still
attached. The rundown of the object happens at vnode rundown time, and
happens with exactly the same filesystem semantics of the original VFS
code. There is absolutely no need for vnode_pager_uncache and other
travesties like that anymore.
A side-effect of these changes is that SMP locking should be much simpler,
the I/O copyin/copyout optimizations work, NFS should be more ponderable,
and further work on layered filesystems should be less frustrating, because
of the totally coherent management of the vnode objects and vnodes.
Please be careful with your system while running this code, but I would
greatly appreciate feedback as soon a reasonably possible.
1998-01-06 05:26:17 +00:00
|
|
|
if (bp->b_bufsize == fs->fs_bsize)
|
|
|
|
bp->b_flags |= B_CLUSTEROK;
|
1994-05-24 10:09:53 +00:00
|
|
|
bdwrite(bp);
|
|
|
|
}
|
1998-03-08 09:59:44 +00:00
|
|
|
*ap->a_bpp = nbp;
|
1994-05-24 10:09:53 +00:00
|
|
|
return (0);
|
|
|
|
}
|
|
|
|
brelse(bp);
|
|
|
|
if (flags & B_CLRBUF) {
|
|
|
|
error = bread(vp, lbn, (int)fs->fs_bsize, NOCRED, &nbp);
|
|
|
|
if (error) {
|
|
|
|
brelse(nbp);
|
1997-02-10 02:22:35 +00:00
|
|
|
goto fail;
|
1994-05-24 10:09:53 +00:00
|
|
|
}
|
|
|
|
} else {
|
|
|
|
nbp = getblk(vp, lbn, fs->fs_bsize, 0, 0);
|
|
|
|
nbp->b_blkno = fsbtodb(fs, nb);
|
|
|
|
}
|
1998-03-08 09:59:44 +00:00
|
|
|
*ap->a_bpp = nbp;
|
1994-05-24 10:09:53 +00:00
|
|
|
return (0);
|
1997-02-10 02:22:35 +00:00
|
|
|
fail:
|
|
|
|
/*
|
|
|
|
* If we have failed part way through block allocation, we
|
|
|
|
* have to deallocate any indirect blocks that we have allocated.
|
2000-01-11 08:27:00 +00:00
|
|
|
* We have to fsync the file before we start to get rid of all
|
|
|
|
* of its dependencies so that we do not leave them dangling.
|
|
|
|
* We have to sync it at the end so that the soft updates code
|
|
|
|
* does not find any untracked changes. Although this is really
|
|
|
|
* slow, running out of disk space is not expected to be a common
|
|
|
|
* occurence. The error return from fsync is ignored as we already
|
|
|
|
* have an error to return to the user.
|
1997-02-10 02:22:35 +00:00
|
|
|
*/
|
2000-01-11 08:27:00 +00:00
|
|
|
(void) VOP_FSYNC(vp, cred, MNT_WAIT, p);
|
1997-02-10 02:22:35 +00:00
|
|
|
for (deallocated = 0, blkp = allociblk; blkp < allocblk; blkp++) {
|
|
|
|
ffs_blkfree(ip, *blkp, fs->fs_bsize);
|
|
|
|
deallocated += fs->fs_bsize;
|
|
|
|
}
|
|
|
|
if (allocib != NULL)
|
|
|
|
*allocib = 0;
|
|
|
|
if (deallocated) {
|
|
|
|
#ifdef QUOTA
|
|
|
|
/*
|
|
|
|
* Restore user's disk quota because allocation failed.
|
|
|
|
*/
|
|
|
|
(void) chkdq(ip, (long)-btodb(deallocated), cred, FORCE);
|
|
|
|
#endif
|
|
|
|
ip->i_blocks -= btodb(deallocated);
|
|
|
|
ip->i_flag |= IN_CHANGE | IN_UPDATE;
|
|
|
|
}
|
2000-01-11 08:27:00 +00:00
|
|
|
(void) VOP_FSYNC(vp, cred, MNT_WAIT, p);
|
1997-02-10 02:22:35 +00:00
|
|
|
return (error);
|
1994-05-24 10:09:53 +00:00
|
|
|
}
|