minix/netbsd
1
0
Fork 0
mirror of https://github.com/Stichting-MINIX-Research-Foundation/netbsd.git synced 2025-08-17 01:51:58 -04:00
Code Issues Packages Projects Releases Wiki Activity
netbsd/sys/ufs/lfs/lfs_alloc.c
Lionel Sambuc db4f849365 2015/10/10 12:00:00 UTC
2015-10-15 10:25:28 +02:00

653 lines
18 KiB
C
Raw Permalink Blame History

/* $NetBSD: lfs_alloc.c,v 1.130 2015/09/13 07:53:37 dholland Exp $ */
/*-
* Copyright (c) 1999, 2000, 2001, 2002, 2003, 2007 The NetBSD Foundation, Inc.
* All rights reserved.
*
* This code is derived from software contributed to The NetBSD Foundation
* by Konrad E. Schroder <perseant@hhhh.org>.
*
* 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.
*
* THIS SOFTWARE IS PROVIDED BY THE NETBSD FOUNDATION, INC. 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 FOUNDATION 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.
*/
/*
* Copyright (c) 1991, 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. 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.
*
* @(#)lfs_alloc.c 8.4 (Berkeley) 1/4/94
*/
#include <sys/cdefs.h>
__KERNEL_RCSID(0, "$NetBSD: lfs_alloc.c,v 1.130 2015/09/13 07:53:37 dholland Exp $");
#if defined(_KERNEL_OPT)
#include "opt_quota.h"
#endif
#include <sys/param.h>
#include <sys/systm.h>
#include <sys/kernel.h>
#include <sys/buf.h>
#include <sys/lock.h>
#include <sys/vnode.h>
#include <sys/syslog.h>
#include <sys/mount.h>
#include <sys/malloc.h>
#include <sys/pool.h>
#include <sys/proc.h>
#include <sys/tree.h>
#include <sys/kauth.h>
#include <ufs/lfs/ulfs_quotacommon.h>
#include <ufs/lfs/ulfs_inode.h>
#include <ufs/lfs/ulfsmount.h>
#include <ufs/lfs/ulfs_extern.h>
#include <ufs/lfs/lfs.h>
#include <ufs/lfs/lfs_accessors.h>
#include <ufs/lfs/lfs_extern.h>
#include <ufs/lfs/lfs_kernel.h>
/* Constants for inode free bitmap */
#define BMSHIFT 5 /* 2 ** 5 = 32 */
#define BMMASK ((1 << BMSHIFT) - 1)
#define SET_BITMAP_FREE(F, I) do { \
DLOG((DLOG_ALLOC, "lfs: ino %d wrd %d bit %d set\n", (int)(I), \
(int)((I) >> BMSHIFT), (int)((I) & BMMASK))); \
(F)->lfs_ino_bitmap[(I) >> BMSHIFT] |= (1 << ((I) & BMMASK)); \
} while (0)
#define CLR_BITMAP_FREE(F, I) do { \
DLOG((DLOG_ALLOC, "lfs: ino %d wrd %d bit %d clr\n", (int)(I), \
(int)((I) >> BMSHIFT), (int)((I) & BMMASK))); \
(F)->lfs_ino_bitmap[(I) >> BMSHIFT] &= ~(1 << ((I) & BMMASK)); \
} while(0)
#define ISSET_BITMAP_FREE(F, I) \
((F)->lfs_ino_bitmap[(I) >> BMSHIFT] & (1 << ((I) & BMMASK)))
/*
* Add a new block to the Ifile, to accommodate future file creations.
* Called with the segment lock held.
*/
int
lfs_extend_ifile(struct lfs *fs, kauth_cred_t cred)
{
struct vnode *vp;
struct inode *ip;
IFILE64 *ifp64;
IFILE32 *ifp32;
IFILE_V1 *ifp_v1;
struct buf *bp, *cbp;
int error;
daddr_t i, blkno, xmax;
ino_t oldlast, maxino;
CLEANERINFO *cip;
ASSERT_SEGLOCK(fs);
vp = fs->lfs_ivnode;
ip = VTOI(vp);
blkno = lfs_lblkno(fs, ip->i_size);
if ((error = lfs_balloc(vp, ip->i_size, lfs_sb_getbsize(fs), cred, 0,
&bp)) != 0) {
return (error);
}
ip->i_size += lfs_sb_getbsize(fs);
lfs_dino_setsize(fs, ip->i_din, ip->i_size);
uvm_vnp_setsize(vp, ip->i_size);
maxino = ((ip->i_size >> lfs_sb_getbshift(fs)) - lfs_sb_getcleansz(fs) -
lfs_sb_getsegtabsz(fs)) * lfs_sb_getifpb(fs);
fs->lfs_ino_bitmap = (lfs_bm_t *)
realloc(fs->lfs_ino_bitmap, ((maxino + BMMASK) >> BMSHIFT) *
sizeof(lfs_bm_t), M_SEGMENT, M_WAITOK);
KASSERT(fs->lfs_ino_bitmap != NULL);
i = (blkno - lfs_sb_getsegtabsz(fs) - lfs_sb_getcleansz(fs)) *
lfs_sb_getifpb(fs);
/*
* We insert the new inodes at the head of the free list.
* Under normal circumstances, the free list is empty here,
* so we are also incidentally placing them at the end (which
* we must do if we are to keep them in order).
*/
LFS_GET_HEADFREE(fs, cip, cbp, &oldlast);
LFS_PUT_HEADFREE(fs, cip, cbp, i);
#ifdef DIAGNOSTIC
if (lfs_sb_getfreehd(fs) == LFS_UNUSED_INUM)
panic("inode 0 allocated [2]");
#endif /* DIAGNOSTIC */
xmax = i + lfs_sb_getifpb(fs);
if (fs->lfs_is64) {
for (ifp64 = (IFILE64 *)bp->b_data; i < xmax; ++ifp64) {
SET_BITMAP_FREE(fs, i);
ifp64->if_version = 1;
ifp64->if_daddr = LFS_UNUSED_DADDR;
ifp64->if_nextfree = ++i;
}
ifp64--;
ifp64->if_nextfree = oldlast;
} else if (lfs_sb_getversion(fs) > 1) {
for (ifp32 = (IFILE32 *)bp->b_data; i < xmax; ++ifp32) {
SET_BITMAP_FREE(fs, i);
ifp32->if_version = 1;
ifp32->if_daddr = LFS_UNUSED_DADDR;
ifp32->if_nextfree = ++i;
}
ifp32--;
ifp32->if_nextfree = oldlast;
} else {
for (ifp_v1 = (IFILE_V1 *)bp->b_data; i < xmax; ++ifp_v1) {
SET_BITMAP_FREE(fs, i);
ifp_v1->if_version = 1;
ifp_v1->if_daddr = LFS_UNUSED_DADDR;
ifp_v1->if_nextfree = ++i;
}
ifp_v1--;
ifp_v1->if_nextfree = oldlast;
}
LFS_PUT_TAILFREE(fs, cip, cbp, xmax - 1);
(void) LFS_BWRITE_LOG(bp); /* Ifile */
return 0;
}
/* Allocate a new inode. */
/* ARGSUSED */
/* VOP_BWRITE 2i times */
int
lfs_valloc(struct vnode *pvp, int mode, kauth_cred_t cred,
ino_t *ino, int *gen)
{
struct lfs *fs;
struct buf *bp, *cbp;
IFILE *ifp;
int error;
CLEANERINFO *cip;
fs = VTOI(pvp)->i_lfs;
if (fs->lfs_ronly)
return EROFS;
ASSERT_NO_SEGLOCK(fs);
lfs_seglock(fs, SEGM_PROT);
/* Get the head of the freelist. */
LFS_GET_HEADFREE(fs, cip, cbp, ino);
KASSERT(*ino != LFS_UNUSED_INUM && *ino != LFS_IFILE_INUM);
DLOG((DLOG_ALLOC, "lfs_valloc: allocate inode %" PRId64 "\n",
*ino));
/*
* Remove the inode from the free list and write the new start
* of the free list into the superblock.
*/
CLR_BITMAP_FREE(fs, *ino);
LFS_IENTRY(ifp, fs, *ino, bp);
if (lfs_if_getdaddr(fs, ifp) != LFS_UNUSED_DADDR)
panic("lfs_valloc: inuse inode %" PRId64 " on the free list",
*ino);
LFS_PUT_HEADFREE(fs, cip, cbp, lfs_if_getnextfree(fs, ifp));
DLOG((DLOG_ALLOC, "lfs_valloc: headfree %" PRId64 " -> %ju\n",
*ino, (uintmax_t)lfs_if_getnextfree(fs, ifp)));
/* version was updated by vfree */
*gen = lfs_if_getversion(fs, ifp);
brelse(bp, 0);
/* Extend IFILE so that the next lfs_valloc will succeed. */
if (lfs_sb_getfreehd(fs) == LFS_UNUSED_INUM) {
if ((error = lfs_extend_ifile(fs, cred)) != 0) {
LFS_PUT_HEADFREE(fs, cip, cbp, *ino);
lfs_segunlock(fs);
return error;
}
}
#ifdef DIAGNOSTIC
if (lfs_sb_getfreehd(fs) == LFS_UNUSED_INUM)
panic("inode 0 allocated [3]");
#endif /* DIAGNOSTIC */
/* Set superblock modified bit and increment file count. */
mutex_enter(&lfs_lock);
fs->lfs_fmod = 1;
mutex_exit(&lfs_lock);
lfs_sb_addnfiles(fs, 1);
lfs_segunlock(fs);
return 0;
}
/*
* Allocate a new inode with given inode number and version.
*/
int
lfs_valloc_fixed(struct lfs *fs, ino_t ino, int vers)
{
IFILE *ifp;
struct buf *bp, *cbp;
ino_t headino, thisino, oldnext;
CLEANERINFO *cip;
/* If the Ifile is too short to contain this inum, extend it */
while (VTOI(fs->lfs_ivnode)->i_size <= (ino /
lfs_sb_getifpb(fs) + lfs_sb_getcleansz(fs) + lfs_sb_getsegtabsz(fs))
<< lfs_sb_getbshift(fs)) {
lfs_extend_ifile(fs, NOCRED);
}
LFS_IENTRY(ifp, fs, ino, bp);
oldnext = lfs_if_getnextfree(fs, ifp);
lfs_if_setversion(fs, ifp, vers);
brelse(bp, 0);
LFS_GET_HEADFREE(fs, cip, cbp, &headino);
if (headino == ino) {
LFS_PUT_HEADFREE(fs, cip, cbp, oldnext);
} else {
ino_t nextfree;
thisino = headino;
while (1) {
LFS_IENTRY(ifp, fs, thisino, bp);
nextfree = lfs_if_getnextfree(fs, ifp);
if (nextfree == ino ||
nextfree == LFS_UNUSED_INUM)
break;
thisino = nextfree;
brelse(bp, 0);
}
if (nextfree == LFS_UNUSED_INUM) {
brelse(bp, 0);
return ENOENT;
}
lfs_if_setnextfree(fs, ifp, oldnext);
LFS_BWRITE_LOG(bp);
}
return 0;
}
#if 0
/*
* Find the highest-numbered allocated inode.
* This will be used to shrink the Ifile.
*/
static inline ino_t
lfs_last_alloc_ino(struct lfs *fs)
{
ino_t ino, maxino;
maxino = ((fs->lfs_ivnode->v_size >> lfs_sb_getbshift(fs)) -
lfs_sb_getcleansz(fs) - lfs_sb_getsegtabsz(fs)) * fs->lfs_ifpb;
for (ino = maxino - 1; ino > LFS_UNUSED_INUM; --ino) {
if (ISSET_BITMAP_FREE(fs, ino) == 0)
break;
}
return ino;
}
#endif
/*
* Find the previous (next lowest numbered) free inode, if any.
* If there is none, return LFS_UNUSED_INUM.
*/
static inline ino_t
lfs_freelist_prev(struct lfs *fs, ino_t ino)
{
ino_t tino, bound, bb, freehdbb;
if (lfs_sb_getfreehd(fs) == LFS_UNUSED_INUM) /* No free inodes at all */
return LFS_UNUSED_INUM;
/* Search our own word first */
bound = ino & ~BMMASK;
for (tino = ino - 1; tino >= bound && tino > LFS_UNUSED_INUM; tino--)
if (ISSET_BITMAP_FREE(fs, tino))
return tino;
/* If there are no lower words to search, just return */
if (ino >> BMSHIFT == 0)
return LFS_UNUSED_INUM;
/*
* Find a word with a free inode in it. We have to be a bit
* careful here since ino_t is unsigned.
*/
freehdbb = (lfs_sb_getfreehd(fs) >> BMSHIFT);
for (bb = (ino >> BMSHIFT) - 1; bb >= freehdbb && bb > 0; --bb)
if (fs->lfs_ino_bitmap[bb])
break;
if (fs->lfs_ino_bitmap[bb] == 0)
return LFS_UNUSED_INUM;
/* Search the word we found */
for (tino = (bb << BMSHIFT) | BMMASK; tino >= (bb << BMSHIFT) &&
tino > LFS_UNUSED_INUM; tino--)
if (ISSET_BITMAP_FREE(fs, tino))
break;
if (tino <= LFS_IFILE_INUM)
tino = LFS_UNUSED_INUM;
return tino;
}
/* Free an inode. */
/* ARGUSED */
/* VOP_BWRITE 2i times */
int
lfs_vfree(struct vnode *vp, ino_t ino, int mode)
{
SEGUSE *sup;
CLEANERINFO *cip;
struct buf *cbp, *bp;
IFILE *ifp;
struct inode *ip;
struct lfs *fs;
daddr_t old_iaddr;
ino_t otail;
/* Get the inode number and file system. */
ip = VTOI(vp);
fs = ip->i_lfs;
ino = ip->i_number;
ASSERT_NO_SEGLOCK(fs);
DLOG((DLOG_ALLOC, "lfs_vfree: free ino %lld\n", (long long)ino));
/* Drain of pending writes */
mutex_enter(vp->v_interlock);
while (lfs_sb_getversion(fs) > 1 && WRITEINPROG(vp)) {
cv_wait(&vp->v_cv, vp->v_interlock);
}
mutex_exit(vp->v_interlock);
lfs_seglock(fs, SEGM_PROT);
lfs_unmark_vnode(vp);
mutex_enter(&lfs_lock);
if (vp->v_uflag & VU_DIROP) {
vp->v_uflag &= ~VU_DIROP;
--lfs_dirvcount;
--fs->lfs_dirvcount;
TAILQ_REMOVE(&fs->lfs_dchainhd, ip, i_lfs_dchain);
wakeup(&fs->lfs_dirvcount);
wakeup(&lfs_dirvcount);
mutex_exit(&lfs_lock);
vrele(vp);
/*
* If this inode is not going to be written any more, any
* segment accounting left over from its truncation needs
* to occur at the end of the next dirops flush. Attach
* them to the fs-wide list for that purpose.
*/
if (LIST_FIRST(&ip->i_lfs_segdhd) != NULL) {
struct segdelta *sd;
while((sd = LIST_FIRST(&ip->i_lfs_segdhd)) != NULL) {
LIST_REMOVE(sd, list);
LIST_INSERT_HEAD(&fs->lfs_segdhd, sd, list);
}
}
} else {
/*
* If it's not a dirop, we can finalize right away.
*/
mutex_exit(&lfs_lock);
lfs_finalize_ino_seguse(fs, ip);
}
mutex_enter(&lfs_lock);
LFS_CLR_UINO(ip, IN_ACCESSED|IN_CLEANING|IN_MODIFIED);
mutex_exit(&lfs_lock);
ip->i_flag &= ~IN_ALLMOD;
ip->i_lfs_iflags |= LFSI_DELETED;
/*
* Set the ifile's inode entry to unused, increment its version number
* and link it onto the free chain.
*/
SET_BITMAP_FREE(fs, ino);
LFS_IENTRY(ifp, fs, ino, bp);
old_iaddr = lfs_if_getdaddr(fs, ifp);
lfs_if_setdaddr(fs, ifp, LFS_UNUSED_DADDR);
lfs_if_setversion(fs, ifp, lfs_if_getversion(fs, ifp) + 1);
if (lfs_sb_getversion(fs) == 1) {
ino_t nextfree;
LFS_GET_HEADFREE(fs, cip, cbp, &nextfree);
lfs_if_setnextfree(fs, ifp, nextfree);
LFS_PUT_HEADFREE(fs, cip, cbp, ino);
(void) LFS_BWRITE_LOG(bp); /* Ifile */
} else {
ino_t tino, onf;
lfs_if_setnextfree(fs, ifp, LFS_UNUSED_INUM);
(void) LFS_BWRITE_LOG(bp); /* Ifile */
tino = lfs_freelist_prev(fs, ino);
if (tino == LFS_UNUSED_INUM) {
ino_t nextfree;
/* Nothing free below us, put us on the head */
LFS_IENTRY(ifp, fs, ino, bp);
LFS_GET_HEADFREE(fs, cip, cbp, &nextfree);
lfs_if_setnextfree(fs, ifp, nextfree);
LFS_PUT_HEADFREE(fs, cip, cbp, ino);
DLOG((DLOG_ALLOC, "lfs_vfree: headfree %lld -> %lld\n",
(long long)nextfree, (long long)ino));
LFS_BWRITE_LOG(bp); /* Ifile */
/* If the list was empty, set tail too */
LFS_GET_TAILFREE(fs, cip, cbp, &otail);
if (otail == LFS_UNUSED_INUM) {
LFS_PUT_TAILFREE(fs, cip, cbp, ino);
DLOG((DLOG_ALLOC, "lfs_vfree: tailfree %lld "
"-> %lld\n", (long long)otail,
(long long)ino));
}
} else {
/*
* Insert this inode into the list after tino.
* We hold the segment lock so we don't have to
* worry about blocks being written out of order.
*/
DLOG((DLOG_ALLOC, "lfs_vfree: insert ino %lld "
" after %lld\n", ino, tino));
LFS_IENTRY(ifp, fs, tino, bp);
onf = lfs_if_getnextfree(fs, ifp);
lfs_if_setnextfree(fs, ifp, ino);
LFS_BWRITE_LOG(bp); /* Ifile */
LFS_IENTRY(ifp, fs, ino, bp);
lfs_if_setnextfree(fs, ifp, onf);
LFS_BWRITE_LOG(bp); /* Ifile */
/* If we're last, put us on the tail */
if (onf == LFS_UNUSED_INUM) {
LFS_GET_TAILFREE(fs, cip, cbp, &otail);
LFS_PUT_TAILFREE(fs, cip, cbp, ino);
DLOG((DLOG_ALLOC, "lfs_vfree: tailfree %lld "
"-> %lld\n", (long long)otail,
(long long)ino));
}
}
}
#ifdef DIAGNOSTIC
if (ino == LFS_UNUSED_INUM) {
panic("inode 0 freed");
}
#endif /* DIAGNOSTIC */
if (old_iaddr != LFS_UNUSED_DADDR) {
LFS_SEGENTRY(sup, fs, lfs_dtosn(fs, old_iaddr), bp);
#ifdef DIAGNOSTIC
if (sup->su_nbytes < DINOSIZE(fs)) {
printf("lfs_vfree: negative byte count"
" (segment %" PRIu32 " short by %d)\n",
lfs_dtosn(fs, old_iaddr),
(int)DINOSIZE(fs) -
sup->su_nbytes);
panic("lfs_vfree: negative byte count");
sup->su_nbytes = DINOSIZE(fs);
}
#endif
sup->su_nbytes -= DINOSIZE(fs);
LFS_WRITESEGENTRY(sup, fs, lfs_dtosn(fs, old_iaddr), bp); /* Ifile */
}
/* Set superblock modified bit and decrement file count. */
mutex_enter(&lfs_lock);
fs->lfs_fmod = 1;
mutex_exit(&lfs_lock);
lfs_sb_subnfiles(fs, 1);
lfs_segunlock(fs);
return (0);
}
/*
* Sort the freelist and set up the free-inode bitmap.
* To be called by lfs_mountfs().
*/
void
lfs_order_freelist(struct lfs *fs)
{
CLEANERINFO *cip;
IFILE *ifp = NULL;
struct buf *bp;
ino_t ino, firstino, lastino, maxino;
#ifdef notyet
struct vnode *vp;
#endif
ASSERT_NO_SEGLOCK(fs);
lfs_seglock(fs, SEGM_PROT);
maxino = ((fs->lfs_ivnode->v_size >> lfs_sb_getbshift(fs)) -
lfs_sb_getcleansz(fs) - lfs_sb_getsegtabsz(fs)) * lfs_sb_getifpb(fs);
fs->lfs_ino_bitmap =
malloc(((maxino + BMMASK) >> BMSHIFT) * sizeof(lfs_bm_t),
M_SEGMENT, M_WAITOK | M_ZERO);
KASSERT(fs->lfs_ino_bitmap != NULL);
firstino = lastino = LFS_UNUSED_INUM;
for (ino = 0; ino < maxino; ino++) {
if (ino % lfs_sb_getifpb(fs) == 0)
LFS_IENTRY(ifp, fs, ino, bp);
else
LFS_IENTRY_NEXT(ifp, fs);
/* Don't put zero or ifile on the free list */
if (ino == LFS_UNUSED_INUM || ino == LFS_IFILE_INUM)
continue;
#ifdef notyet
/* Address orphaned files */
if (lfs_if_getnextfree(fs, ifp) == LFS_ORPHAN_NEXTFREE &&
VFS_VGET(fs->lfs_ivnode->v_mount, ino, &vp) == 0) {
unsigned segno;
segno = lfs_dtosn(fs, lfs_if_getdaddr(fs, ifp));
lfs_truncate(vp, 0, 0, NOCRED);
vput(vp);
LFS_SEGENTRY(sup, fs, segno, bp);
KASSERT(sup->su_nbytes >= LFS_DINODE1_SIZE);
sup->su_nbytes -= LFS_DINODE1_SIZE;
LFS_WRITESEGENTRY(sup, fs, segno, bp);
/* Set up to fall through to next section */
lfs_if_setdaddr(fs, ifp, LFS_UNUSED_DADDR);
LFS_BWRITE_LOG(bp);
LFS_IENTRY(ifp, fs, ino, bp);
}
#endif
if (lfs_if_getdaddr(fs, ifp) == LFS_UNUSED_DADDR) {
if (firstino == LFS_UNUSED_INUM)
firstino = ino;
else {
brelse(bp, 0);
LFS_IENTRY(ifp, fs, lastino, bp);
lfs_if_setnextfree(fs, ifp, ino);
LFS_BWRITE_LOG(bp);
LFS_IENTRY(ifp, fs, ino, bp);
}
lastino = ino;
SET_BITMAP_FREE(fs, ino);
}
if ((ino + 1) % lfs_sb_getifpb(fs) == 0)
brelse(bp, 0);
}
LFS_PUT_HEADFREE(fs, cip, bp, firstino);
LFS_PUT_TAILFREE(fs, cip, bp, lastino);
lfs_segunlock(fs);
}
void
lfs_orphan(struct lfs *fs, ino_t ino)
{
IFILE *ifp;
struct buf *bp;
LFS_IENTRY(ifp, fs, ino, bp);
lfs_if_setnextfree(fs, ifp, LFS_ORPHAN_NEXTFREE);
LFS_BWRITE_LOG(bp);
}
Reference in New Issue View Git Blame Copy Permalink