/* $NetBSD: lfs_vnops.c,v 1.239.2.2 2016/08/27 14:13:18 bouyer Exp $ */ /*- * Copyright (c) 1999, 2000, 2001, 2002, 2003 The NetBSD Foundation, Inc. * All rights reserved. * * This code is derived from software contributed to The NetBSD Foundation * by Konrad E. Schroder . * * 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) 1986, 1989, 1991, 1993, 1995 * 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_vnops.c 8.13 (Berkeley) 6/10/95 */ #include __KERNEL_RCSID(0, "$NetBSD: lfs_vnops.c,v 1.239.2.2 2016/08/27 14:13:18 bouyer Exp $"); #ifdef _KERNEL_OPT #include "opt_compat_netbsd.h" #include "opt_uvm_page_trkown.h" #endif #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include extern pid_t lfs_writer_daemon; int lfs_ignore_lazy_sync = 1; /* Global vfs data structures for lfs. */ int (**lfs_vnodeop_p)(void *); const struct vnodeopv_entry_desc lfs_vnodeop_entries[] = { { &vop_default_desc, vn_default_error }, { &vop_lookup_desc, ufs_lookup }, /* lookup */ { &vop_create_desc, lfs_create }, /* create */ { &vop_whiteout_desc, ufs_whiteout }, /* whiteout */ { &vop_mknod_desc, lfs_mknod }, /* mknod */ { &vop_open_desc, ufs_open }, /* open */ { &vop_close_desc, lfs_close }, /* close */ { &vop_access_desc, ufs_access }, /* access */ { &vop_getattr_desc, lfs_getattr }, /* getattr */ { &vop_setattr_desc, lfs_setattr }, /* setattr */ { &vop_read_desc, lfs_read }, /* read */ { &vop_write_desc, lfs_write }, /* write */ { &vop_ioctl_desc, ufs_ioctl }, /* ioctl */ { &vop_fcntl_desc, lfs_fcntl }, /* fcntl */ { &vop_poll_desc, ufs_poll }, /* poll */ { &vop_kqfilter_desc, genfs_kqfilter }, /* kqfilter */ { &vop_revoke_desc, ufs_revoke }, /* revoke */ { &vop_mmap_desc, lfs_mmap }, /* mmap */ { &vop_fsync_desc, lfs_fsync }, /* fsync */ { &vop_seek_desc, ufs_seek }, /* seek */ { &vop_remove_desc, lfs_remove }, /* remove */ { &vop_link_desc, lfs_link }, /* link */ { &vop_rename_desc, lfs_rename }, /* rename */ { &vop_mkdir_desc, lfs_mkdir }, /* mkdir */ { &vop_rmdir_desc, lfs_rmdir }, /* rmdir */ { &vop_symlink_desc, lfs_symlink }, /* symlink */ { &vop_readdir_desc, ufs_readdir }, /* readdir */ { &vop_readlink_desc, ufs_readlink }, /* readlink */ { &vop_abortop_desc, ufs_abortop }, /* abortop */ { &vop_inactive_desc, lfs_inactive }, /* inactive */ { &vop_reclaim_desc, lfs_reclaim }, /* reclaim */ { &vop_lock_desc, ufs_lock }, /* lock */ { &vop_unlock_desc, ufs_unlock }, /* unlock */ { &vop_bmap_desc, ufs_bmap }, /* bmap */ { &vop_strategy_desc, lfs_strategy }, /* strategy */ { &vop_print_desc, ufs_print }, /* print */ { &vop_islocked_desc, ufs_islocked }, /* islocked */ { &vop_pathconf_desc, ufs_pathconf }, /* pathconf */ { &vop_advlock_desc, ufs_advlock }, /* advlock */ { &vop_bwrite_desc, lfs_bwrite }, /* bwrite */ { &vop_getpages_desc, lfs_getpages }, /* getpages */ { &vop_putpages_desc, lfs_putpages }, /* putpages */ { NULL, NULL } }; const struct vnodeopv_desc lfs_vnodeop_opv_desc = { &lfs_vnodeop_p, lfs_vnodeop_entries }; int (**lfs_specop_p)(void *); const struct vnodeopv_entry_desc lfs_specop_entries[] = { { &vop_default_desc, vn_default_error }, { &vop_lookup_desc, spec_lookup }, /* lookup */ { &vop_create_desc, spec_create }, /* create */ { &vop_mknod_desc, spec_mknod }, /* mknod */ { &vop_open_desc, spec_open }, /* open */ { &vop_close_desc, lfsspec_close }, /* close */ { &vop_access_desc, ufs_access }, /* access */ { &vop_getattr_desc, lfs_getattr }, /* getattr */ { &vop_setattr_desc, lfs_setattr }, /* setattr */ { &vop_read_desc, ufsspec_read }, /* read */ { &vop_write_desc, ufsspec_write }, /* write */ { &vop_ioctl_desc, spec_ioctl }, /* ioctl */ { &vop_fcntl_desc, ufs_fcntl }, /* fcntl */ { &vop_poll_desc, spec_poll }, /* poll */ { &vop_kqfilter_desc, spec_kqfilter }, /* kqfilter */ { &vop_revoke_desc, spec_revoke }, /* revoke */ { &vop_mmap_desc, spec_mmap }, /* mmap */ { &vop_fsync_desc, spec_fsync }, /* fsync */ { &vop_seek_desc, spec_seek }, /* seek */ { &vop_remove_desc, spec_remove }, /* remove */ { &vop_link_desc, spec_link }, /* link */ { &vop_rename_desc, spec_rename }, /* rename */ { &vop_mkdir_desc, spec_mkdir }, /* mkdir */ { &vop_rmdir_desc, spec_rmdir }, /* rmdir */ { &vop_symlink_desc, spec_symlink }, /* symlink */ { &vop_readdir_desc, spec_readdir }, /* readdir */ { &vop_readlink_desc, spec_readlink }, /* readlink */ { &vop_abortop_desc, spec_abortop }, /* abortop */ { &vop_inactive_desc, lfs_inactive }, /* inactive */ { &vop_reclaim_desc, lfs_reclaim }, /* reclaim */ { &vop_lock_desc, ufs_lock }, /* lock */ { &vop_unlock_desc, ufs_unlock }, /* unlock */ { &vop_bmap_desc, spec_bmap }, /* bmap */ { &vop_strategy_desc, spec_strategy }, /* strategy */ { &vop_print_desc, ufs_print }, /* print */ { &vop_islocked_desc, ufs_islocked }, /* islocked */ { &vop_pathconf_desc, spec_pathconf }, /* pathconf */ { &vop_advlock_desc, spec_advlock }, /* advlock */ { &vop_bwrite_desc, vn_bwrite }, /* bwrite */ { &vop_getpages_desc, spec_getpages }, /* getpages */ { &vop_putpages_desc, spec_putpages }, /* putpages */ { NULL, NULL } }; const struct vnodeopv_desc lfs_specop_opv_desc = { &lfs_specop_p, lfs_specop_entries }; int (**lfs_fifoop_p)(void *); const struct vnodeopv_entry_desc lfs_fifoop_entries[] = { { &vop_default_desc, vn_default_error }, { &vop_lookup_desc, vn_fifo_bypass }, /* lookup */ { &vop_create_desc, vn_fifo_bypass }, /* create */ { &vop_mknod_desc, vn_fifo_bypass }, /* mknod */ { &vop_open_desc, vn_fifo_bypass }, /* open */ { &vop_close_desc, lfsfifo_close }, /* close */ { &vop_access_desc, ufs_access }, /* access */ { &vop_getattr_desc, lfs_getattr }, /* getattr */ { &vop_setattr_desc, lfs_setattr }, /* setattr */ { &vop_read_desc, ufsfifo_read }, /* read */ { &vop_write_desc, ufsfifo_write }, /* write */ { &vop_ioctl_desc, vn_fifo_bypass }, /* ioctl */ { &vop_fcntl_desc, ufs_fcntl }, /* fcntl */ { &vop_poll_desc, vn_fifo_bypass }, /* poll */ { &vop_kqfilter_desc, vn_fifo_bypass }, /* kqfilter */ { &vop_revoke_desc, vn_fifo_bypass }, /* revoke */ { &vop_mmap_desc, vn_fifo_bypass }, /* mmap */ { &vop_fsync_desc, vn_fifo_bypass }, /* fsync */ { &vop_seek_desc, vn_fifo_bypass }, /* seek */ { &vop_remove_desc, vn_fifo_bypass }, /* remove */ { &vop_link_desc, vn_fifo_bypass }, /* link */ { &vop_rename_desc, vn_fifo_bypass }, /* rename */ { &vop_mkdir_desc, vn_fifo_bypass }, /* mkdir */ { &vop_rmdir_desc, vn_fifo_bypass }, /* rmdir */ { &vop_symlink_desc, vn_fifo_bypass }, /* symlink */ { &vop_readdir_desc, vn_fifo_bypass }, /* readdir */ { &vop_readlink_desc, vn_fifo_bypass }, /* readlink */ { &vop_abortop_desc, vn_fifo_bypass }, /* abortop */ { &vop_inactive_desc, lfs_inactive }, /* inactive */ { &vop_reclaim_desc, lfs_reclaim }, /* reclaim */ { &vop_lock_desc, ufs_lock }, /* lock */ { &vop_unlock_desc, ufs_unlock }, /* unlock */ { &vop_bmap_desc, vn_fifo_bypass }, /* bmap */ { &vop_strategy_desc, vn_fifo_bypass }, /* strategy */ { &vop_print_desc, ufs_print }, /* print */ { &vop_islocked_desc, ufs_islocked }, /* islocked */ { &vop_pathconf_desc, vn_fifo_bypass }, /* pathconf */ { &vop_advlock_desc, vn_fifo_bypass }, /* advlock */ { &vop_bwrite_desc, lfs_bwrite }, /* bwrite */ { &vop_putpages_desc, vn_fifo_bypass }, /* putpages */ { NULL, NULL } }; const struct vnodeopv_desc lfs_fifoop_opv_desc = { &lfs_fifoop_p, lfs_fifoop_entries }; static int check_dirty(struct lfs *, struct vnode *, off_t, off_t, off_t, int, int, struct vm_page **); #define LFS_READWRITE #include #undef LFS_READWRITE /* * Synch an open file. */ /* ARGSUSED */ int lfs_fsync(void *v) { struct vop_fsync_args /* { struct vnode *a_vp; kauth_cred_t a_cred; int a_flags; off_t offlo; off_t offhi; } */ *ap = v; struct vnode *vp = ap->a_vp; int error, wait; struct inode *ip = VTOI(vp); struct lfs *fs = ip->i_lfs; /* If we're mounted read-only, don't try to sync. */ if (fs->lfs_ronly) return 0; /* If a removed vnode is being cleaned, no need to sync here. */ if ((ap->a_flags & FSYNC_RECLAIM) != 0 && ip->i_mode == 0) return 0; /* * Trickle sync simply adds this vnode to the pager list, as if * the pagedaemon had requested a pageout. */ if (ap->a_flags & FSYNC_LAZY) { if (lfs_ignore_lazy_sync == 0) { mutex_enter(&lfs_lock); if (!(ip->i_flags & IN_PAGING)) { ip->i_flags |= IN_PAGING; TAILQ_INSERT_TAIL(&fs->lfs_pchainhd, ip, i_lfs_pchain); } wakeup(&lfs_writer_daemon); mutex_exit(&lfs_lock); } return 0; } /* * If a vnode is bring cleaned, flush it out before we try to * reuse it. This prevents the cleaner from writing files twice * in the same partial segment, causing an accounting underflow. */ if (ap->a_flags & FSYNC_RECLAIM && ip->i_flags & IN_CLEANING) { lfs_vflush(vp); } wait = (ap->a_flags & FSYNC_WAIT); do { mutex_enter(vp->v_interlock); error = VOP_PUTPAGES(vp, trunc_page(ap->a_offlo), round_page(ap->a_offhi), PGO_CLEANIT | (wait ? PGO_SYNCIO : 0)); if (error == EAGAIN) { mutex_enter(&lfs_lock); mtsleep(&fs->lfs_avail, PCATCH | PUSER, "lfs_fsync", hz / 100 + 1, &lfs_lock); mutex_exit(&lfs_lock); } } while (error == EAGAIN); if (error) return error; if ((ap->a_flags & FSYNC_DATAONLY) == 0) error = lfs_update(vp, NULL, NULL, wait ? UPDATE_WAIT : 0); if (error == 0 && ap->a_flags & FSYNC_CACHE) { int l = 0; error = VOP_IOCTL(ip->i_devvp, DIOCCACHESYNC, &l, FWRITE, curlwp->l_cred); } if (wait && !VPISEMPTY(vp)) LFS_SET_UINO(ip, IN_MODIFIED); return error; } /* * Take IN_ADIROP off, then call ufs_inactive. */ int lfs_inactive(void *v) { struct vop_inactive_args /* { struct vnode *a_vp; } */ *ap = v; lfs_unmark_vnode(ap->a_vp); /* * The Ifile is only ever inactivated on unmount. * Streamline this process by not giving it more dirty blocks. */ if (VTOI(ap->a_vp)->i_number == LFS_IFILE_INUM) { mutex_enter(&lfs_lock); LFS_CLR_UINO(VTOI(ap->a_vp), IN_ALLMOD); mutex_exit(&lfs_lock); VOP_UNLOCK(ap->a_vp); return 0; } #ifdef DEBUG /* * This might happen on unmount. * XXX If it happens at any other time, it should be a panic. */ if (ap->a_vp->v_uflag & VU_DIROP) { struct inode *ip = VTOI(ap->a_vp); printf("lfs_inactive: inactivating VU_DIROP? ino = %d\n", (int)ip->i_number); } #endif /* DIAGNOSTIC */ return ufs_inactive(v); } /* * These macros are used to bracket UFS directory ops, so that we can * identify all the pages touched during directory ops which need to * be ordered and flushed atomically, so that they may be recovered. * * Because we have to mark nodes VU_DIROP in order to prevent * the cache from reclaiming them while a dirop is in progress, we must * also manage the number of nodes so marked (otherwise we can run out). * We do this by setting lfs_dirvcount to the number of marked vnodes; it * is decremented during segment write, when VU_DIROP is taken off. */ #define MARK_VNODE(vp) lfs_mark_vnode(vp) #define UNMARK_VNODE(vp) lfs_unmark_vnode(vp) #define SET_DIROP_CREATE(dvp, vpp) lfs_set_dirop_create((dvp), (vpp)) #define SET_DIROP_REMOVE(dvp, vp) lfs_set_dirop((dvp), (vp)) static int lfs_set_dirop_create(struct vnode *, struct vnode **); static int lfs_set_dirop(struct vnode *, struct vnode *); static int lfs_set_dirop(struct vnode *dvp, struct vnode *vp) { struct lfs *fs; int error; KASSERT(VOP_ISLOCKED(dvp)); KASSERT(vp == NULL || VOP_ISLOCKED(vp)); fs = VTOI(dvp)->i_lfs; ASSERT_NO_SEGLOCK(fs); /* * LFS_NRESERVE calculates direct and indirect blocks as well * as an inode block; an overestimate in most cases. */ if ((error = lfs_reserve(fs, dvp, vp, LFS_NRESERVE(fs))) != 0) return (error); restart: mutex_enter(&lfs_lock); if (fs->lfs_dirops == 0) { mutex_exit(&lfs_lock); lfs_check(dvp, LFS_UNUSED_LBN, 0); mutex_enter(&lfs_lock); } while (fs->lfs_writer) { error = mtsleep(&fs->lfs_dirops, (PRIBIO + 1) | PCATCH, "lfs_sdirop", 0, &lfs_lock); if (error == EINTR) { mutex_exit(&lfs_lock); goto unreserve; } } if (lfs_dirvcount > LFS_MAX_DIROP && fs->lfs_dirops == 0) { wakeup(&lfs_writer_daemon); mutex_exit(&lfs_lock); preempt(); goto restart; } if (lfs_dirvcount > LFS_MAX_DIROP) { DLOG((DLOG_DIROP, "lfs_set_dirop: sleeping with dirops=%d, " "dirvcount=%d\n", fs->lfs_dirops, lfs_dirvcount)); if ((error = mtsleep(&lfs_dirvcount, PCATCH | PUSER | PNORELOCK, "lfs_maxdirop", 0, &lfs_lock)) != 0) { mutex_exit(&lfs_lock); goto unreserve; } mutex_exit(&lfs_lock); goto restart; } ++fs->lfs_dirops; /* fs->lfs_doifile = 1; */ /* XXX why? --ks */ mutex_exit(&lfs_lock); /* Hold a reference so SET_ENDOP will be happy */ vref(dvp); if (vp) { vref(vp); MARK_VNODE(vp); } MARK_VNODE(dvp); return 0; unreserve: lfs_reserve(fs, dvp, vp, -LFS_NRESERVE(fs)); return error; } /* * Get a new vnode *before* adjusting the dirop count, to avoid a deadlock * in getnewvnode(), if we have a stacked filesystem mounted on top * of us. * * NB: this means we have to clear the new vnodes on error. Fortunately * SET_ENDOP is there to do that for us. */ static int lfs_set_dirop_create(struct vnode *dvp, struct vnode **vpp) { int error; struct lfs *fs; fs = VFSTOUFS(dvp->v_mount)->um_lfs; ASSERT_NO_SEGLOCK(fs); if (fs->lfs_ronly) return EROFS; if (vpp == NULL) { return lfs_set_dirop(dvp, NULL); } error = getnewvnode(VT_LFS, dvp->v_mount, lfs_vnodeop_p, NULL, vpp); if (error) { DLOG((DLOG_ALLOC, "lfs_set_dirop_create: dvp %p error %d\n", dvp, error)); return error; } if ((error = lfs_set_dirop(dvp, NULL)) != 0) { ungetnewvnode(*vpp); *vpp = NULL; return error; } return 0; } #define SET_ENDOP_BASE(fs, dvp, str) \ do { \ mutex_enter(&lfs_lock); \ --(fs)->lfs_dirops; \ if (!(fs)->lfs_dirops) { \ if ((fs)->lfs_nadirop) { \ panic("SET_ENDOP: %s: no dirops but " \ " nadirop=%d", (str), \ (fs)->lfs_nadirop); \ } \ wakeup(&(fs)->lfs_writer); \ mutex_exit(&lfs_lock); \ lfs_check((dvp), LFS_UNUSED_LBN, 0); \ } else \ mutex_exit(&lfs_lock); \ } while(0) #define SET_ENDOP_CREATE(fs, dvp, nvpp, str) \ do { \ UNMARK_VNODE(dvp); \ if (nvpp && *nvpp) \ UNMARK_VNODE(*nvpp); \ /* Check for error return to stem vnode leakage */ \ if (nvpp && *nvpp && !((*nvpp)->v_uflag & VU_DIROP)) \ ungetnewvnode(*(nvpp)); \ SET_ENDOP_BASE((fs), (dvp), (str)); \ lfs_reserve((fs), (dvp), NULL, -LFS_NRESERVE(fs)); \ vrele(dvp); \ } while(0) #define SET_ENDOP_CREATE_AP(ap, str) \ SET_ENDOP_CREATE(VTOI((ap)->a_dvp)->i_lfs, (ap)->a_dvp, \ (ap)->a_vpp, (str)) #define SET_ENDOP_REMOVE(fs, dvp, ovp, str) \ do { \ UNMARK_VNODE(dvp); \ if (ovp) \ UNMARK_VNODE(ovp); \ SET_ENDOP_BASE((fs), (dvp), (str)); \ lfs_reserve((fs), (dvp), (ovp), -LFS_NRESERVE(fs)); \ vrele(dvp); \ if (ovp) \ vrele(ovp); \ } while(0) void lfs_mark_vnode(struct vnode *vp) { struct inode *ip = VTOI(vp); struct lfs *fs = ip->i_lfs; mutex_enter(&lfs_lock); if (!(ip->i_flag & IN_ADIROP)) { if (!(vp->v_uflag & VU_DIROP)) { mutex_exit(&lfs_lock); mutex_enter(vp->v_interlock); if (lfs_vref(vp) != 0) panic("lfs_mark_vnode: could not vref"); mutex_enter(&lfs_lock); ++lfs_dirvcount; ++fs->lfs_dirvcount; TAILQ_INSERT_TAIL(&fs->lfs_dchainhd, ip, i_lfs_dchain); vp->v_uflag |= VU_DIROP; } ++fs->lfs_nadirop; ip->i_flag &= ~IN_CDIROP; ip->i_flag |= IN_ADIROP; } else KASSERT(vp->v_uflag & VU_DIROP); mutex_exit(&lfs_lock); } void lfs_unmark_vnode(struct vnode *vp) { struct inode *ip = VTOI(vp); mutex_enter(&lfs_lock); if (ip && (ip->i_flag & IN_ADIROP)) { KASSERT(vp->v_uflag & VU_DIROP); --ip->i_lfs->lfs_nadirop; ip->i_flag &= ~IN_ADIROP; } mutex_exit(&lfs_lock); } int lfs_symlink(void *v) { struct vop_symlink_args /* { struct vnode *a_dvp; struct vnode **a_vpp; struct componentname *a_cnp; struct vattr *a_vap; char *a_target; } */ *ap = v; int error; if ((error = SET_DIROP_CREATE(ap->a_dvp, ap->a_vpp)) != 0) { vput(ap->a_dvp); return error; } error = ufs_symlink(ap); SET_ENDOP_CREATE_AP(ap, "symlink"); return (error); } int lfs_mknod(void *v) { struct vop_mknod_args /* { struct vnode *a_dvp; struct vnode **a_vpp; struct componentname *a_cnp; struct vattr *a_vap; } */ *ap = v; struct vattr *vap = ap->a_vap; struct vnode **vpp = ap->a_vpp; struct inode *ip; int error; struct mount *mp; ino_t ino; struct ufs_lookup_results *ulr; /* XXX should handle this material another way */ ulr = &VTOI(ap->a_dvp)->i_crap; UFS_CHECK_CRAPCOUNTER(VTOI(ap->a_dvp)); if ((error = SET_DIROP_CREATE(ap->a_dvp, ap->a_vpp)) != 0) { vput(ap->a_dvp); return error; } error = ufs_makeinode(MAKEIMODE(vap->va_type, vap->va_mode), ap->a_dvp, ulr, vpp, ap->a_cnp); /* Either way we're done with the dirop at this point */ SET_ENDOP_CREATE_AP(ap, "mknod"); if (error) return (error); ip = VTOI(*vpp); mp = (*vpp)->v_mount; ino = ip->i_number; ip->i_flag |= IN_ACCESS | IN_CHANGE | IN_UPDATE; if (vap->va_rdev != VNOVAL) { /* * Want to be able to use this to make badblock * inodes, so don't truncate the dev number. */ #if 0 ip->i_ffs1_rdev = ufs_rw32(vap->va_rdev, UFS_MPNEEDSWAP((*vpp)->v_mount)); #else ip->i_ffs1_rdev = vap->va_rdev; #endif } /* * Call fsync to write the vnode so that we don't have to deal with * flushing it when it's marked VU_DIROP|VI_XLOCK. * * XXX KS - If we can't flush we also can't call vgone(), so must * return. But, that leaves this vnode in limbo, also not good. * Can this ever happen (barring hardware failure)? */ if ((error = VOP_FSYNC(*vpp, NOCRED, FSYNC_WAIT, 0, 0)) != 0) { panic("lfs_mknod: couldn't fsync (ino %llu)", (unsigned long long)ino); /* return (error); */ } /* * Remove vnode so that it will be reloaded by VFS_VGET and * checked to see if it is an alias of an existing entry in * the inode cache. */ /* Used to be vput, but that causes us to call VOP_INACTIVE twice. */ VOP_UNLOCK(*vpp); (*vpp)->v_type = VNON; vgone(*vpp); error = VFS_VGET(mp, ino, vpp); if (error != 0) { *vpp = NULL; return (error); } return (0); } int lfs_create(void *v) { struct vop_create_args /* { struct vnode *a_dvp; struct vnode **a_vpp; struct componentname *a_cnp; struct vattr *a_vap; } */ *ap = v; int error; if ((error = SET_DIROP_CREATE(ap->a_dvp, ap->a_vpp)) != 0) { vput(ap->a_dvp); return error; } error = ufs_create(ap); SET_ENDOP_CREATE_AP(ap, "create"); return (error); } int lfs_mkdir(void *v) { struct vop_mkdir_args /* { struct vnode *a_dvp; struct vnode **a_vpp; struct componentname *a_cnp; struct vattr *a_vap; } */ *ap = v; int error; if ((error = SET_DIROP_CREATE(ap->a_dvp, ap->a_vpp)) != 0) { vput(ap->a_dvp); return error; } error = ufs_mkdir(ap); SET_ENDOP_CREATE_AP(ap, "mkdir"); return (error); } int lfs_remove(void *v) { struct vop_remove_args /* { struct vnode *a_dvp; struct vnode *a_vp; struct componentname *a_cnp; } */ *ap = v; struct vnode *dvp, *vp; struct inode *ip; int error; dvp = ap->a_dvp; vp = ap->a_vp; ip = VTOI(vp); if ((error = SET_DIROP_REMOVE(dvp, vp)) != 0) { if (dvp == vp) vrele(vp); else vput(vp); vput(dvp); return error; } error = ufs_remove(ap); if (ip->i_nlink == 0) lfs_orphan(ip->i_lfs, ip->i_number); SET_ENDOP_REMOVE(ip->i_lfs, dvp, ap->a_vp, "remove"); return (error); } int lfs_rmdir(void *v) { struct vop_rmdir_args /* { struct vnodeop_desc *a_desc; struct vnode *a_dvp; struct vnode *a_vp; struct componentname *a_cnp; } */ *ap = v; struct vnode *vp; struct inode *ip; int error; vp = ap->a_vp; ip = VTOI(vp); if ((error = SET_DIROP_REMOVE(ap->a_dvp, ap->a_vp)) != 0) { if (ap->a_dvp == vp) vrele(ap->a_dvp); else vput(ap->a_dvp); vput(vp); return error; } error = ufs_rmdir(ap); if (ip->i_nlink == 0) lfs_orphan(ip->i_lfs, ip->i_number); SET_ENDOP_REMOVE(ip->i_lfs, ap->a_dvp, ap->a_vp, "rmdir"); return (error); } int lfs_link(void *v) { struct vop_link_args /* { struct vnode *a_dvp; struct vnode *a_vp; struct componentname *a_cnp; } */ *ap = v; int error; struct vnode **vpp = NULL; if ((error = SET_DIROP_CREATE(ap->a_dvp, vpp)) != 0) { vput(ap->a_dvp); return error; } error = ufs_link(ap); SET_ENDOP_CREATE(VTOI(ap->a_dvp)->i_lfs, ap->a_dvp, vpp, "link"); return (error); } /* XXX following lifted from ufs_lookup.c */ #define FSFMT(vp) (((vp)->v_mount->mnt_iflag & IMNT_DTYPE) == 0) /* * Check if either entry referred to by FROM_ULR is within the range * of entries named by TO_ULR. */ static int ulr_overlap(const struct ufs_lookup_results *from_ulr, const struct ufs_lookup_results *to_ulr) { doff_t from_start, from_prevstart; doff_t to_start, to_end; /* * FROM is a DELETE result; offset points to the entry to * remove and subtracting count gives the previous entry. */ from_start = from_ulr->ulr_offset - from_ulr->ulr_count; from_prevstart = from_ulr->ulr_offset; /* * TO is a RENAME (thus non-DELETE) result; offset points * to the beginning of a region to write in, and adding * count gives the end of the region. */ to_start = to_ulr->ulr_offset; to_end = to_ulr->ulr_offset + to_ulr->ulr_count; if (from_prevstart >= to_start && from_prevstart < to_end) { return 1; } if (from_start >= to_start && from_start < to_end) { return 1; } return 0; } /* * A virgin directory (no blushing please). */ static const struct dirtemplate mastertemplate = { 0, 12, DT_DIR, 1, ".", 0, DIRBLKSIZ - 12, DT_DIR, 2, ".." }; /* * Wrapper for relookup that also updates the supplemental results. */ static int do_relookup(struct vnode *dvp, struct ufs_lookup_results *ulr, struct vnode **vp, struct componentname *cnp) { int error; error = relookup(dvp, vp, cnp, 0); if (error) { return error; } /* update the supplemental reasults */ *ulr = VTOI(dvp)->i_crap; UFS_CHECK_CRAPCOUNTER(VTOI(dvp)); return 0; } /* * Lock and relookup a sequence of two directories and two children. * */ static int lock_vnode_sequence(struct vnode *d1, struct ufs_lookup_results *ulr1, struct vnode **v1_ret, struct componentname *cn1, int v1_missing_ok, int overlap_error, struct vnode *d2, struct ufs_lookup_results *ulr2, struct vnode **v2_ret, struct componentname *cn2, int v2_missing_ok) { struct vnode *v1, *v2; int error; KASSERT(d1 != d2); vn_lock(d1, LK_EXCLUSIVE | LK_RETRY); if (VTOI(d1)->i_size == 0) { /* d1 has been rmdir'd */ VOP_UNLOCK(d1); return ENOENT; } error = do_relookup(d1, ulr1, &v1, cn1); if (v1_missing_ok) { if (error == ENOENT) { /* * Note: currently if the name doesn't exist, * relookup succeeds (it intercepts the * EJUSTRETURN from VOP_LOOKUP) and sets tvp * to NULL. Therefore, we will never get * ENOENT and this branch is not needed. * However, in a saner future the EJUSTRETURN * garbage will go away, so let's DTRT. */ v1 = NULL; error = 0; } } else { if (error == 0 && v1 == NULL) { /* This is what relookup sets if v1 disappeared. */ error = ENOENT; } } if (error) { VOP_UNLOCK(d1); return error; } if (v1 && v1 == d2) { VOP_UNLOCK(d1); VOP_UNLOCK(v1); vrele(v1); return overlap_error; } /* * The right way to do this is to do lookups without locking * the results, and lock the results afterwards; then at the * end we can avoid trying to lock v2 if v2 == v1. * * However, for the reasons described in the fdvp == tdvp case * in rename below, we can't do that safely. So, in the case * where v1 is not a directory, unlock it and lock it again * afterwards. This is safe in locking order because a * non-directory can't be above anything else in the tree. If * v1 *is* a directory, that's not true, but then because d1 * != d2, v1 != v2. */ if (v1 && v1->v_type != VDIR) { VOP_UNLOCK(v1); } vn_lock(d2, LK_EXCLUSIVE | LK_RETRY); if (VTOI(d2)->i_size == 0) { /* d2 has been rmdir'd */ VOP_UNLOCK(d2); if (v1 && v1->v_type == VDIR) { VOP_UNLOCK(v1); } VOP_UNLOCK(d1); if (v1) { vrele(v1); } return ENOENT; } error = do_relookup(d2, ulr2, &v2, cn2); if (v2_missing_ok) { if (error == ENOENT) { /* as above */ v2 = NULL; error = 0; } } else { if (error == 0 && v2 == NULL) { /* This is what relookup sets if v2 disappeared. */ error = ENOENT; } } if (error) { VOP_UNLOCK(d2); if (v1 && v1->v_type == VDIR) { VOP_UNLOCK(v1); } VOP_UNLOCK(d1); if (v1) { vrele(v1); } return error; } if (v1 && v1->v_type != VDIR && v1 != v2) { vn_lock(v1, LK_EXCLUSIVE | LK_RETRY); } *v1_ret = v1; *v2_ret = v2; return 0; } int lfs_rename(void *v) { struct vop_rename_args /* { struct vnode *a_fdvp; struct vnode *a_fvp; struct componentname *a_fcnp; struct vnode *a_tdvp; struct vnode *a_tvp; struct componentname *a_tcnp; } */ *ap = v; struct vnode *tvp, *tdvp, *fvp, *fdvp; struct componentname *tcnp, *fcnp; struct inode *ip, *txp, *fxp, *tdp, *fdp; struct mount *mp; struct direct *newdir; int doingdirectory, error, marked; ino_t oldparent, newparent; struct ufs_lookup_results from_ulr, to_ulr; struct lfs *fs = VTOI(ap->a_fvp)->i_lfs; tvp = ap->a_tvp; tdvp = ap->a_tdvp; fvp = ap->a_fvp; fdvp = ap->a_fdvp; tcnp = ap->a_tcnp; fcnp = ap->a_fcnp; doingdirectory = error = 0; oldparent = newparent = 0; marked = 0; /* save the supplemental lookup results as they currently exist */ from_ulr = VTOI(fdvp)->i_crap; to_ulr = VTOI(tdvp)->i_crap; UFS_CHECK_CRAPCOUNTER(VTOI(fdvp)); UFS_CHECK_CRAPCOUNTER(VTOI(tdvp)); /* * Owing to VFS oddities we are currently called with tdvp/tvp * locked and not fdvp/fvp. In a sane world we'd be passed * tdvp and fdvp only, unlocked, and two name strings. Pretend * we have a sane world and unlock tdvp and tvp. */ VOP_UNLOCK(tdvp); if (tvp && tvp != tdvp) { VOP_UNLOCK(tvp); } /* Also pretend we have a sane world and vrele fvp/tvp. */ vrele(fvp); fvp = NULL; if (tvp) { vrele(tvp); tvp = NULL; } /* * Check for cross-device rename. */ if (fdvp->v_mount != tdvp->v_mount) { error = EXDEV; goto abort; } /* * Reject "." and ".." */ if ((fcnp->cn_flags & ISDOTDOT) || (tcnp->cn_flags & ISDOTDOT) || (fcnp->cn_namelen == 1 && fcnp->cn_nameptr[0] == '.') || (tcnp->cn_namelen == 1 && tcnp->cn_nameptr[0] == '.')) { error = EINVAL; goto abort; } /* * Get locks. */ /* paranoia */ fcnp->cn_flags |= LOCKPARENT|LOCKLEAF; tcnp->cn_flags |= LOCKPARENT|LOCKLEAF; if (fdvp == tdvp) { /* One directory. Lock it and relookup both children. */ vn_lock(fdvp, LK_EXCLUSIVE | LK_RETRY); if (VTOI(fdvp)->i_size == 0) { /* directory has been rmdir'd */ VOP_UNLOCK(fdvp); error = ENOENT; goto abort; } error = do_relookup(fdvp, &from_ulr, &fvp, fcnp); if (error == 0 && fvp == NULL) { /* relookup may produce this if fvp disappears */ error = ENOENT; } if (error) { VOP_UNLOCK(fdvp); goto abort; } /* * The right way to do this is to look up both children * without locking either, and then lock both unless they * turn out to be the same. However, due to deep-seated * VFS-level issues all lookups lock the child regardless * of whether LOCKLEAF is set (if LOCKLEAF is not set, * the child is locked during lookup and then unlocked) * so it is not safe to look up tvp while fvp is locked. * * Unlocking fvp here temporarily is more or less safe, * because with the directory locked there's not much * that can happen to it. However, ideally it wouldn't * be necessary. XXX. */ VOP_UNLOCK(fvp); /* remember fdvp == tdvp so tdvp is locked */ error = do_relookup(tdvp, &to_ulr, &tvp, tcnp); if (error && error != ENOENT) { VOP_UNLOCK(fdvp); goto abort; } if (error == ENOENT) { /* * Note: currently if the name doesn't exist, * relookup succeeds (it intercepts the * EJUSTRETURN from VOP_LOOKUP) and sets tvp * to NULL. Therefore, we will never get * ENOENT and this branch is not needed. * However, in a saner future the EJUSTRETURN * garbage will go away, so let's DTRT. */ tvp = NULL; } /* tvp is locked; lock fvp if necessary */ if (!tvp || tvp != fvp) { vn_lock(fvp, LK_EXCLUSIVE | LK_RETRY); } } else { int found_fdvp; struct vnode *illegal_fvp; /* * The source must not be above the destination. (If * it were, the rename would detach a section of the * tree.) * * Look up the tree from tdvp to see if we find fdvp, * and if so, return the immediate child of fdvp we're * under; that must not turn out to be the same as * fvp. * * The per-volume rename lock guarantees that the * result of this check remains true until we finish * looking up and locking. */ error = ufs_parentcheck(fdvp, tdvp, fcnp->cn_cred, &found_fdvp, &illegal_fvp); if (error) { goto abort; } /* Must lock in tree order. */ if (found_fdvp) { /* fdvp -> fvp -> tdvp -> tvp */ error = lock_vnode_sequence(fdvp, &from_ulr, &fvp, fcnp, 0, EINVAL, tdvp, &to_ulr, &tvp, tcnp, 1); } else { /* tdvp -> tvp -> fdvp -> fvp */ error = lock_vnode_sequence(tdvp, &to_ulr, &tvp, tcnp, 1, ENOTEMPTY, fdvp, &from_ulr, &fvp, fcnp, 0); } if (error) { if (illegal_fvp) { vrele(illegal_fvp); } goto abort; } KASSERT(fvp != NULL); if (illegal_fvp && fvp == illegal_fvp) { vrele(illegal_fvp); error = EINVAL; goto abort_withlocks; } if (illegal_fvp) { vrele(illegal_fvp); } } KASSERT(fdvp && VOP_ISLOCKED(fdvp)); KASSERT(fvp && VOP_ISLOCKED(fvp)); KASSERT(tdvp && VOP_ISLOCKED(tdvp)); KASSERT(tvp == NULL || VOP_ISLOCKED(tvp)); /* --- everything is now locked --- */ if (tvp && ((VTOI(tvp)->i_flags & (IMMUTABLE | APPEND)) || (VTOI(tdvp)->i_flags & APPEND))) { error = EPERM; goto abort_withlocks; } /* * Check if just deleting a link name. */ if (fvp == tvp) { if (fvp->v_type == VDIR) { error = EINVAL; goto abort_withlocks; } /* Release destination completely. Leave fdvp locked. */ VOP_ABORTOP(tdvp, tcnp); if (fdvp != tdvp) { VOP_UNLOCK(tdvp); } VOP_UNLOCK(tvp); vrele(tdvp); vrele(tvp); /* Delete source. */ /* XXX: do we really need to relookup again? */ /* * fdvp is still locked, but we just unlocked fvp * (because fvp == tvp) so just decref fvp */ vrele(fvp); fcnp->cn_flags &= ~(MODMASK); fcnp->cn_flags |= LOCKPARENT | LOCKLEAF; fcnp->cn_nameiop = DELETE; if ((error = relookup(fdvp, &fvp, fcnp, 0))) { vput(fdvp); return (error); } return (VOP_REMOVE(fdvp, fvp, fcnp)); } /* The tiny bit of actual LFS code in this function */ if ((error = SET_DIROP_REMOVE(tdvp, tvp)) != 0) goto abort_withlocks; MARK_VNODE(fdvp); MARK_VNODE(fvp); marked = 1; fdp = VTOI(fdvp); ip = VTOI(fvp); if ((nlink_t) ip->i_nlink >= LINK_MAX) { error = EMLINK; goto abort_withlocks; } if ((ip->i_flags & (IMMUTABLE | APPEND)) || (fdp->i_flags & APPEND)) { error = EPERM; goto abort_withlocks; } if ((ip->i_mode & IFMT) == IFDIR) { /* * Avoid ".", "..", and aliases of "." for obvious reasons. */ if ((fcnp->cn_namelen == 1 && fcnp->cn_nameptr[0] == '.') || fdp == ip || (fcnp->cn_flags & ISDOTDOT) || (tcnp->cn_flags & ISDOTDOT) || (ip->i_flag & IN_RENAME)) { error = EINVAL; goto abort_withlocks; } ip->i_flag |= IN_RENAME; doingdirectory = 1; } oldparent = fdp->i_number; VN_KNOTE(fdvp, NOTE_WRITE); /* XXXLUKEM/XXX: right place? */ /* * Both the directory * and target vnodes are locked. */ tdp = VTOI(tdvp); txp = NULL; if (tvp) txp = VTOI(tvp); mp = fdvp->v_mount; fstrans_start(mp, FSTRANS_SHARED); if (oldparent != tdp->i_number) newparent = tdp->i_number; /* * If ".." must be changed (ie the directory gets a new * parent) the user must have write permission in the source * so as to be able to change "..". */ if (doingdirectory && newparent) { error = VOP_ACCESS(fvp, VWRITE, tcnp->cn_cred); if (error) goto out; } KASSERT(fdvp != tvp); if (newparent) { /* Check for the rename("foo/foo", "foo") case. */ if (fdvp == tvp) { error = doingdirectory ? ENOTEMPTY : EISDIR; goto out; } } fxp = VTOI(fvp); fdp = VTOI(fdvp); error = UFS_WAPBL_BEGIN(fdvp->v_mount); if (error) goto out2; /* * 1) Bump link count while we're moving stuff * around. If we crash somewhere before * completing our work, the link count * may be wrong, but correctable. */ ip->i_nlink++; DIP_ASSIGN(ip, nlink, ip->i_nlink); ip->i_flag |= IN_CHANGE; if ((error = UFS_UPDATE(fvp, NULL, NULL, UPDATE_DIROP)) != 0) { goto bad; } /* * 2) If target doesn't exist, link the target * to the source and unlink the source. * Otherwise, rewrite the target directory * entry to reference the source inode and * expunge the original entry's existence. */ if (txp == NULL) { if (tdp->i_dev != ip->i_dev) panic("rename: EXDEV"); /* * Account for ".." in new directory. * When source and destination have the same * parent we don't fool with the link count. */ if (doingdirectory && newparent) { if ((nlink_t)tdp->i_nlink >= LINK_MAX) { error = EMLINK; goto bad; } tdp->i_nlink++; DIP_ASSIGN(tdp, nlink, tdp->i_nlink); tdp->i_flag |= IN_CHANGE; if ((error = UFS_UPDATE(tdvp, NULL, NULL, UPDATE_DIROP)) != 0) { tdp->i_nlink--; DIP_ASSIGN(tdp, nlink, tdp->i_nlink); tdp->i_flag |= IN_CHANGE; goto bad; } } newdir = pool_cache_get(ufs_direct_cache, PR_WAITOK); ufs_makedirentry(ip, tcnp, newdir); error = ufs_direnter(tdvp, &to_ulr, NULL, newdir, tcnp, NULL); pool_cache_put(ufs_direct_cache, newdir); if (error != 0) { if (doingdirectory && newparent) { tdp->i_nlink--; DIP_ASSIGN(tdp, nlink, tdp->i_nlink); tdp->i_flag |= IN_CHANGE; (void)UFS_UPDATE(tdvp, NULL, NULL, UPDATE_WAIT | UPDATE_DIROP); } goto bad; } VN_KNOTE(tdvp, NOTE_WRITE); } else { if (txp->i_dev != tdp->i_dev || txp->i_dev != ip->i_dev) panic("rename: EXDEV"); /* * Short circuit rename(foo, foo). */ if (txp->i_number == ip->i_number) panic("rename: same file"); /* * If the parent directory is "sticky", then the user must * own the parent directory, or the destination of the rename, * otherwise the destination may not be changed (except by * root). This implements append-only directories. */ if ((tdp->i_mode & S_ISTXT) && kauth_authorize_generic(tcnp->cn_cred, KAUTH_GENERIC_ISSUSER, NULL) != 0 && kauth_cred_geteuid(tcnp->cn_cred) != tdp->i_uid && txp->i_uid != kauth_cred_geteuid(tcnp->cn_cred)) { error = EPERM; goto bad; } /* * Target must be empty if a directory and have no links * to it. Also, ensure source and target are compatible * (both directories, or both not directories). */ if ((txp->i_mode & IFMT) == IFDIR) { if (txp->i_nlink > 2 || !ufs_dirempty(txp, tdp->i_number, tcnp->cn_cred)) { error = ENOTEMPTY; goto bad; } if (!doingdirectory) { error = ENOTDIR; goto bad; } cache_purge(tdvp); } else if (doingdirectory) { error = EISDIR; goto bad; } if ((error = ufs_dirrewrite(tdp, to_ulr.ulr_offset, txp, ip->i_number, IFTODT(ip->i_mode), doingdirectory && newparent ? newparent : doingdirectory, IN_CHANGE | IN_UPDATE)) != 0) goto bad; if (doingdirectory) { /* * Truncate inode. The only stuff left in the directory * is "." and "..". The "." reference is inconsequential * since we are quashing it. We have removed the "." * reference and the reference in the parent directory, * but there may be other hard links. */ if (!newparent) { tdp->i_nlink--; DIP_ASSIGN(tdp, nlink, tdp->i_nlink); tdp->i_flag |= IN_CHANGE; UFS_WAPBL_UPDATE(tdvp, NULL, NULL, 0); } txp->i_nlink--; DIP_ASSIGN(txp, nlink, txp->i_nlink); txp->i_flag |= IN_CHANGE; if ((error = UFS_TRUNCATE(tvp, (off_t)0, IO_SYNC, tcnp->cn_cred))) goto bad; } VN_KNOTE(tdvp, NOTE_WRITE); VN_KNOTE(tvp, NOTE_DELETE); } /* * Handle case where the directory entry we need to remove, * which is/was at from_ulr.ulr_offset, or the one before it, * which is/was at from_ulr.ulr_offset - from_ulr.ulr_count, * may have been moved when the directory insertion above * performed compaction. */ if (tdp->i_number == fdp->i_number && ulr_overlap(&from_ulr, &to_ulr)) { struct buf *bp; struct direct *ep; struct ufsmount *ump = fdp->i_ump; doff_t curpos; doff_t endsearch; /* offset to end directory search */ uint32_t prev_reclen; int dirblksiz = ump->um_dirblksiz; const int needswap = UFS_MPNEEDSWAP(ump); u_long bmask; int namlen, entryoffsetinblock; char *dirbuf; bmask = fdvp->v_mount->mnt_stat.f_iosize - 1; /* * The fcnp entry will be somewhere between the start of * compaction (to_ulr.ulr_offset) and the original location * (from_ulr.ulr_offset). */ curpos = to_ulr.ulr_offset; endsearch = from_ulr.ulr_offset + from_ulr.ulr_reclen; entryoffsetinblock = 0; /* * Get the directory block containing the start of * compaction. */ error = ufs_blkatoff(fdvp, (off_t)to_ulr.ulr_offset, &dirbuf, &bp, false); if (error) goto bad; /* * Keep existing ulr_count (length of previous record) * for the case where compaction did not include the * previous entry but started at the from-entry. */ prev_reclen = from_ulr.ulr_count; while (curpos < endsearch) { uint32_t reclen; /* * If necessary, get the next directory block. * * dholland 7/13/11 to the best of my understanding * this should never happen; compaction occurs only * within single blocks. I think. */ if ((curpos & bmask) == 0) { if (bp != NULL) brelse(bp, 0); error = ufs_blkatoff(fdvp, (off_t)curpos, &dirbuf, &bp, false); if (error) goto bad; entryoffsetinblock = 0; } KASSERT(bp != NULL); ep = (struct direct *)(dirbuf + entryoffsetinblock); reclen = ufs_rw16(ep->d_reclen, needswap); #if (BYTE_ORDER == LITTLE_ENDIAN) if (FSFMT(fdvp) && needswap == 0) namlen = ep->d_type; else namlen = ep->d_namlen; #else if (FSFMT(fdvp) && needswap != 0) namlen = ep->d_type; else namlen = ep->d_namlen; #endif if ((ep->d_ino != 0) && (ufs_rw32(ep->d_ino, needswap) != WINO) && (namlen == fcnp->cn_namelen) && memcmp(ep->d_name, fcnp->cn_nameptr, namlen) == 0) { from_ulr.ulr_reclen = reclen; break; } curpos += reclen; entryoffsetinblock += reclen; prev_reclen = reclen; } from_ulr.ulr_offset = curpos; from_ulr.ulr_count = prev_reclen; KASSERT(curpos <= endsearch); /* * If ulr_offset points to start of a directory block, * clear ulr_count so ufs_dirremove() doesn't try to * merge free space over a directory block boundary. */ if ((from_ulr.ulr_offset & (dirblksiz - 1)) == 0) from_ulr.ulr_count = 0; brelse(bp, 0); } /* * 3) Unlink the source. */ #if 0 /* * Ensure that the directory entry still exists and has not * changed while the new name has been entered. If the source is * a file then the entry may have been unlinked or renamed. In * either case there is no further work to be done. If the source * is a directory then it cannot have been rmdir'ed; The IRENAME * flag ensures that it cannot be moved by another rename or removed * by a rmdir. */ #endif KASSERT(fxp == ip); /* * If the source is a directory with a new parent, the link * count of the old parent directory must be decremented and * ".." set to point to the new parent. */ if (doingdirectory && newparent) { KASSERT(fdp != NULL); ufs_dirrewrite(fxp, mastertemplate.dot_reclen, fdp, newparent, DT_DIR, 0, IN_CHANGE); cache_purge(fdvp); } error = ufs_dirremove(fdvp, &from_ulr, fxp, fcnp->cn_flags, 0); fxp->i_flag &= ~IN_RENAME; VN_KNOTE(fvp, NOTE_RENAME); goto done; out: goto out2; /* exit routines from steps 1 & 2 */ bad: if (doingdirectory) ip->i_flag &= ~IN_RENAME; ip->i_nlink--; DIP_ASSIGN(ip, nlink, ip->i_nlink); ip->i_flag |= IN_CHANGE; ip->i_flag &= ~IN_RENAME; UFS_WAPBL_UPDATE(fvp, NULL, NULL, 0); done: UFS_WAPBL_END(fdvp->v_mount); out2: /* * clear IN_RENAME - some exit paths happen too early to go * through the cleanup done in the "bad" case above, so we * always do this mini-cleanup here. */ ip->i_flag &= ~IN_RENAME; VOP_UNLOCK(fdvp); if (tdvp != fdvp) { VOP_UNLOCK(tdvp); } VOP_UNLOCK(fvp); if (tvp && tvp != fvp) { VOP_UNLOCK(tvp); } vrele(fdvp); vrele(tdvp); vrele(fvp); if (tvp) { vrele(tvp); } fstrans_done(mp); if (marked) { UNMARK_VNODE(fdvp); UNMARK_VNODE(fvp); SET_ENDOP_REMOVE(fs, tdvp, tvp, "rename"); } return (error); abort_withlocks: VOP_UNLOCK(fdvp); if (tdvp != fdvp) { VOP_UNLOCK(tdvp); } VOP_UNLOCK(fvp); if (tvp && tvp != fvp) { VOP_UNLOCK(tvp); } abort: VOP_ABORTOP(fdvp, fcnp); /* XXX, why not in NFS? */ VOP_ABORTOP(tdvp, tcnp); /* XXX, why not in NFS? */ vrele(tdvp); if (tvp) { vrele(tvp); } vrele(fdvp); if (fvp) { vrele(fvp); } if (marked) { UNMARK_VNODE(fdvp); UNMARK_VNODE(fvp); SET_ENDOP_REMOVE(fs, tdvp, tvp, "rename"); } return (error); } /* XXX hack to avoid calling ITIMES in getattr */ int lfs_getattr(void *v) { struct vop_getattr_args /* { struct vnode *a_vp; struct vattr *a_vap; kauth_cred_t a_cred; } */ *ap = v; struct vnode *vp = ap->a_vp; struct inode *ip = VTOI(vp); struct vattr *vap = ap->a_vap; struct lfs *fs = ip->i_lfs; /* * Copy from inode table */ vap->va_fsid = ip->i_dev; vap->va_fileid = ip->i_number; vap->va_mode = ip->i_mode & ~IFMT; vap->va_nlink = ip->i_nlink; vap->va_uid = ip->i_uid; vap->va_gid = ip->i_gid; vap->va_rdev = (dev_t)ip->i_ffs1_rdev; vap->va_size = vp->v_size; vap->va_atime.tv_sec = ip->i_ffs1_atime; vap->va_atime.tv_nsec = ip->i_ffs1_atimensec; vap->va_mtime.tv_sec = ip->i_ffs1_mtime; vap->va_mtime.tv_nsec = ip->i_ffs1_mtimensec; vap->va_ctime.tv_sec = ip->i_ffs1_ctime; vap->va_ctime.tv_nsec = ip->i_ffs1_ctimensec; vap->va_flags = ip->i_flags; vap->va_gen = ip->i_gen; /* this doesn't belong here */ if (vp->v_type == VBLK) vap->va_blocksize = BLKDEV_IOSIZE; else if (vp->v_type == VCHR) vap->va_blocksize = MAXBSIZE; else vap->va_blocksize = vp->v_mount->mnt_stat.f_iosize; vap->va_bytes = fsbtob(fs, (u_quad_t)ip->i_lfs_effnblks); vap->va_type = vp->v_type; vap->va_filerev = ip->i_modrev; return (0); } /* * Check to make sure the inode blocks won't choke the buffer * cache, then call ufs_setattr as usual. */ int lfs_setattr(void *v) { struct vop_setattr_args /* { struct vnode *a_vp; struct vattr *a_vap; kauth_cred_t a_cred; } */ *ap = v; struct vnode *vp = ap->a_vp; lfs_check(vp, LFS_UNUSED_LBN, 0); return ufs_setattr(v); } /* * Release the block we hold on lfs_newseg wrapping. Called on file close, * or explicitly from LFCNWRAPGO. Called with the interlock held. */ static int lfs_wrapgo(struct lfs *fs, struct inode *ip, int waitfor) { if (fs->lfs_stoplwp != curlwp) return EBUSY; fs->lfs_stoplwp = NULL; cv_signal(&fs->lfs_stopcv); KASSERT(fs->lfs_nowrap > 0); if (fs->lfs_nowrap <= 0) { return 0; } if (--fs->lfs_nowrap == 0) { log(LOG_NOTICE, "%s: re-enabled log wrap\n", fs->lfs_fsmnt); wakeup(&fs->lfs_wrappass); lfs_wakeup_cleaner(fs); } if (waitfor) { mtsleep(&fs->lfs_nextseg, PCATCH | PUSER, "segment", 0, &lfs_lock); } return 0; } /* * Close called */ /* ARGSUSED */ int lfs_close(void *v) { struct vop_close_args /* { struct vnode *a_vp; int a_fflag; kauth_cred_t a_cred; } */ *ap = v; struct vnode *vp = ap->a_vp; struct inode *ip = VTOI(vp); struct lfs *fs = ip->i_lfs; if ((ip->i_number == ROOTINO || ip->i_number == LFS_IFILE_INUM) && fs->lfs_stoplwp == curlwp) { mutex_enter(&lfs_lock); log(LOG_NOTICE, "lfs_close: releasing log wrap control\n"); lfs_wrapgo(fs, ip, 0); mutex_exit(&lfs_lock); } if (vp == ip->i_lfs->lfs_ivnode && vp->v_mount->mnt_iflag & IMNT_UNMOUNT) return 0; if (vp->v_usecount > 1 && vp != ip->i_lfs->lfs_ivnode) { LFS_ITIMES(ip, NULL, NULL, NULL); } return (0); } /* * Close wrapper for special devices. * * Update the times on the inode then do device close. */ int lfsspec_close(void *v) { struct vop_close_args /* { struct vnode *a_vp; int a_fflag; kauth_cred_t a_cred; } */ *ap = v; struct vnode *vp; struct inode *ip; vp = ap->a_vp; ip = VTOI(vp); if (vp->v_usecount > 1) { LFS_ITIMES(ip, NULL, NULL, NULL); } return (VOCALL (spec_vnodeop_p, VOFFSET(vop_close), ap)); } /* * Close wrapper for fifo's. * * Update the times on the inode then do device close. */ int lfsfifo_close(void *v) { struct vop_close_args /* { struct vnode *a_vp; int a_fflag; kauth_cred_ a_cred; } */ *ap = v; struct vnode *vp; struct inode *ip; vp = ap->a_vp; ip = VTOI(vp); if (ap->a_vp->v_usecount > 1) { LFS_ITIMES(ip, NULL, NULL, NULL); } return (VOCALL (fifo_vnodeop_p, VOFFSET(vop_close), ap)); } /* * Reclaim an inode so that it can be used for other purposes. */ int lfs_reclaim(void *v) { struct vop_reclaim_args /* { struct vnode *a_vp; } */ *ap = v; struct vnode *vp = ap->a_vp; struct inode *ip = VTOI(vp); struct lfs *fs = ip->i_lfs; int error; /* * The inode must be freed and updated before being removed * from its hash chain. Other threads trying to gain a hold * on the inode will be stalled because it is locked (VI_XLOCK). */ if (ip->i_nlink <= 0 && (vp->v_mount->mnt_flag & MNT_RDONLY) == 0) lfs_vfree(vp, ip->i_number, ip->i_omode); mutex_enter(&lfs_lock); LFS_CLR_UINO(ip, IN_ALLMOD); mutex_exit(&lfs_lock); if ((error = ufs_reclaim(vp))) return (error); /* * Take us off the paging and/or dirop queues if we were on them. * We shouldn't be on them. */ mutex_enter(&lfs_lock); if (ip->i_flags & IN_PAGING) { log(LOG_WARNING, "%s: reclaimed vnode is IN_PAGING\n", fs->lfs_fsmnt); ip->i_flags &= ~IN_PAGING; TAILQ_REMOVE(&fs->lfs_pchainhd, ip, i_lfs_pchain); } if (vp->v_uflag & VU_DIROP) { panic("reclaimed vnode is VU_DIROP"); vp->v_uflag &= ~VU_DIROP; TAILQ_REMOVE(&fs->lfs_dchainhd, ip, i_lfs_dchain); } mutex_exit(&lfs_lock); pool_put(&lfs_dinode_pool, ip->i_din.ffs1_din); lfs_deregister_all(vp); pool_put(&lfs_inoext_pool, ip->inode_ext.lfs); ip->inode_ext.lfs = NULL; genfs_node_destroy(vp); pool_put(&lfs_inode_pool, vp->v_data); vp->v_data = NULL; return (0); } /* * Read a block from a storage device. * In order to avoid reading blocks that are in the process of being * written by the cleaner---and hence are not mutexed by the normal * buffer cache / page cache mechanisms---check for collisions before * reading. * * We inline ufs_strategy to make sure that the VOP_BMAP occurs *before* * the active cleaner test. * * XXX This code assumes that lfs_markv makes synchronous checkpoints. */ int lfs_strategy(void *v) { struct vop_strategy_args /* { struct vnode *a_vp; struct buf *a_bp; } */ *ap = v; struct buf *bp; struct lfs *fs; struct vnode *vp; struct inode *ip; daddr_t tbn; #define MAXLOOP 25 int i, sn, error, slept, loopcount; bp = ap->a_bp; vp = ap->a_vp; ip = VTOI(vp); fs = ip->i_lfs; /* lfs uses its strategy routine only for read */ KASSERT(bp->b_flags & B_READ); if (vp->v_type == VBLK || vp->v_type == VCHR) panic("lfs_strategy: spec"); KASSERT(bp->b_bcount != 0); if (bp->b_blkno == bp->b_lblkno) { error = VOP_BMAP(vp, bp->b_lblkno, NULL, &bp->b_blkno, NULL); if (error) { bp->b_error = error; bp->b_resid = bp->b_bcount; biodone(bp); return (error); } if ((long)bp->b_blkno == -1) /* no valid data */ clrbuf(bp); } if ((long)bp->b_blkno < 0) { /* block is not on disk */ bp->b_resid = bp->b_bcount; biodone(bp); return (0); } slept = 1; loopcount = 0; mutex_enter(&lfs_lock); while (slept && fs->lfs_seglock) { mutex_exit(&lfs_lock); /* * Look through list of intervals. * There will only be intervals to look through * if the cleaner holds the seglock. * Since the cleaner is synchronous, we can trust * the list of intervals to be current. */ tbn = dbtofsb(fs, bp->b_blkno); sn = dtosn(fs, tbn); slept = 0; for (i = 0; i < fs->lfs_cleanind; i++) { if (sn == dtosn(fs, fs->lfs_cleanint[i]) && tbn >= fs->lfs_cleanint[i]) { DLOG((DLOG_CLEAN, "lfs_strategy: ino %d lbn %" PRId64 " ind %d sn %d fsb %" PRIx32 " given sn %d fsb %" PRIx64 "\n", ip->i_number, bp->b_lblkno, i, dtosn(fs, fs->lfs_cleanint[i]), fs->lfs_cleanint[i], sn, tbn)); DLOG((DLOG_CLEAN, "lfs_strategy: sleeping on ino %d lbn %" PRId64 "\n", ip->i_number, bp->b_lblkno)); mutex_enter(&lfs_lock); if (LFS_SEGLOCK_HELD(fs) && fs->lfs_iocount) { /* * Cleaner can't wait for itself. * Instead, wait for the blocks * to be written to disk. * XXX we need pribio in the test * XXX here. */ mtsleep(&fs->lfs_iocount, (PRIBIO + 1) | PNORELOCK, "clean2", hz/10 + 1, &lfs_lock); slept = 1; ++loopcount; break; } else if (fs->lfs_seglock) { mtsleep(&fs->lfs_seglock, (PRIBIO + 1) | PNORELOCK, "clean1", 0, &lfs_lock); slept = 1; break; } mutex_exit(&lfs_lock); } } mutex_enter(&lfs_lock); if (loopcount > MAXLOOP) { printf("lfs_strategy: breaking out of clean2 loop\n"); break; } } mutex_exit(&lfs_lock); vp = ip->i_devvp; VOP_STRATEGY(vp, bp); return (0); } /* * Inline lfs_segwrite/lfs_writevnodes, but just for dirops. * Technically this is a checkpoint (the on-disk state is valid) * even though we are leaving out all the file data. */ int lfs_flush_dirops(struct lfs *fs) { struct inode *ip, *nip; struct vnode *vp; extern int lfs_dostats; struct segment *sp; int flags = 0; int error = 0; ASSERT_MAYBE_SEGLOCK(fs); KASSERT(fs->lfs_nadirop == 0); if (fs->lfs_ronly) return EROFS; mutex_enter(&lfs_lock); if (TAILQ_FIRST(&fs->lfs_dchainhd) == NULL) { mutex_exit(&lfs_lock); return 0; } else mutex_exit(&lfs_lock); if (lfs_dostats) ++lfs_stats.flush_invoked; lfs_imtime(fs); lfs_seglock(fs, flags); sp = fs->lfs_sp; /* * lfs_writevnodes, optimized to get dirops out of the way. * Only write dirops, and don't flush files' pages, only * blocks from the directories. * * We don't need to vref these files because they are * dirops and so hold an extra reference until the * segunlock clears them of that status. * * We don't need to check for IN_ADIROP because we know that * no dirops are active. * */ mutex_enter(&lfs_lock); for (ip = TAILQ_FIRST(&fs->lfs_dchainhd); ip != NULL; ip = nip) { nip = TAILQ_NEXT(ip, i_lfs_dchain); mutex_exit(&lfs_lock); vp = ITOV(ip); KASSERT((ip->i_flag & IN_ADIROP) == 0); KASSERT(vp->v_uflag & VU_DIROP); KASSERT(!(vp->v_iflag & VI_XLOCK)); /* * All writes to directories come from dirops; all * writes to files' direct blocks go through the page * cache, which we're not touching. Reads to files * and/or directories will not be affected by writing * directory blocks inodes and file inodes. So we don't * really need to lock. */ if (vp->v_iflag & VI_XLOCK) { mutex_enter(&lfs_lock); continue; } /* XXX see below * waslocked = VOP_ISLOCKED(vp); */ if (vp->v_type != VREG && ((ip->i_flag & IN_ALLMOD) || !VPISEMPTY(vp))) { error = lfs_writefile(fs, sp, vp); if (!VPISEMPTY(vp) && !WRITEINPROG(vp) && !(ip->i_flag & IN_ALLMOD)) { mutex_enter(&lfs_lock); LFS_SET_UINO(ip, IN_MODIFIED); mutex_exit(&lfs_lock); } if (error && (sp->seg_flags & SEGM_SINGLE)) { mutex_enter(&lfs_lock); error = EAGAIN; break; } } KDASSERT(ip->i_number != LFS_IFILE_INUM); error = lfs_writeinode(fs, sp, ip); mutex_enter(&lfs_lock); if (error && (sp->seg_flags & SEGM_SINGLE)) { error = EAGAIN; break; } /* * We might need to update these inodes again, * for example, if they have data blocks to write. * Make sure that after this flush, they are still * marked IN_MODIFIED so that we don't forget to * write them. */ /* XXX only for non-directories? --KS */ LFS_SET_UINO(ip, IN_MODIFIED); } mutex_exit(&lfs_lock); /* We've written all the dirops there are */ ((SEGSUM *)(sp->segsum))->ss_flags &= ~(SS_CONT); lfs_finalize_fs_seguse(fs); (void) lfs_writeseg(fs, sp); lfs_segunlock(fs); return error; } /* * Flush all vnodes for which the pagedaemon has requested pageouts. * Skip over any files that are marked VU_DIROP (since lfs_flush_dirop() * has just run, this would be an error). If we have to skip a vnode * for any reason, just skip it; if we have to wait for the cleaner, * abort. The writer daemon will call us again later. */ int lfs_flush_pchain(struct lfs *fs) { struct inode *ip, *nip; struct vnode *vp; extern int lfs_dostats; struct segment *sp; int error, error2; ASSERT_NO_SEGLOCK(fs); if (fs->lfs_ronly) return EROFS; mutex_enter(&lfs_lock); if (TAILQ_FIRST(&fs->lfs_pchainhd) == NULL) { mutex_exit(&lfs_lock); return 0; } else mutex_exit(&lfs_lock); /* Get dirops out of the way */ if ((error = lfs_flush_dirops(fs)) != 0) return error; if (lfs_dostats) ++lfs_stats.flush_invoked; /* * Inline lfs_segwrite/lfs_writevnodes, but just for pageouts. */ lfs_imtime(fs); lfs_seglock(fs, 0); sp = fs->lfs_sp; /* * lfs_writevnodes, optimized to clear pageout requests. * Only write non-dirop files that are in the pageout queue. * We're very conservative about what we write; we want to be * fast and async. */ mutex_enter(&lfs_lock); top: for (ip = TAILQ_FIRST(&fs->lfs_pchainhd); ip != NULL; ip = nip) { nip = TAILQ_NEXT(ip, i_lfs_pchain); vp = ITOV(ip); if (!(ip->i_flags & IN_PAGING)) goto top; mutex_enter(vp->v_interlock); if ((vp->v_iflag & VI_XLOCK) || (vp->v_uflag & VU_DIROP) != 0) { mutex_exit(vp->v_interlock); continue; } if (vp->v_type != VREG) { mutex_exit(vp->v_interlock); continue; } if (lfs_vref(vp)) continue; mutex_exit(&lfs_lock); if (vn_lock(vp, LK_EXCLUSIVE | LK_NOWAIT | LK_RETRY) != 0) { lfs_vunref(vp); mutex_enter(&lfs_lock); continue; } error = lfs_writefile(fs, sp, vp); if (!VPISEMPTY(vp) && !WRITEINPROG(vp) && !(ip->i_flag & IN_ALLMOD)) { mutex_enter(&lfs_lock); LFS_SET_UINO(ip, IN_MODIFIED); mutex_exit(&lfs_lock); } KDASSERT(ip->i_number != LFS_IFILE_INUM); error2 = lfs_writeinode(fs, sp, ip); VOP_UNLOCK(vp); lfs_vunref(vp); if (error == EAGAIN || error2 == EAGAIN) { lfs_writeseg(fs, sp); mutex_enter(&lfs_lock); break; } mutex_enter(&lfs_lock); } mutex_exit(&lfs_lock); (void) lfs_writeseg(fs, sp); lfs_segunlock(fs); return 0; } /* * Provide a fcntl interface to sys_lfs_{segwait,bmapv,markv}. */ int lfs_fcntl(void *v) { struct vop_fcntl_args /* { struct vnode *a_vp; u_int a_command; void * a_data; int a_fflag; kauth_cred_t a_cred; } */ *ap = v; struct timeval tv; struct timeval *tvp; BLOCK_INFO *blkiov; CLEANERINFO *cip; SEGUSE *sup; int blkcnt, error, oclean; size_t fh_size; struct lfs_fcntl_markv blkvp; struct lwp *l; fsid_t *fsidp; struct lfs *fs; struct buf *bp; fhandle_t *fhp; daddr_t off; /* Only respect LFS fcntls on fs root or Ifile */ if (VTOI(ap->a_vp)->i_number != ROOTINO && VTOI(ap->a_vp)->i_number != LFS_IFILE_INUM) { return ufs_fcntl(v); } /* Avoid locking a draining lock */ if (ap->a_vp->v_mount->mnt_iflag & IMNT_UNMOUNT) { return ESHUTDOWN; } /* LFS control and monitoring fcntls are available only to root */ l = curlwp; if (((ap->a_command & 0xff00) >> 8) == 'L' && (error = kauth_authorize_generic(l->l_cred, KAUTH_GENERIC_ISSUSER, NULL)) != 0) return (error); fs = VTOI(ap->a_vp)->i_lfs; fsidp = &ap->a_vp->v_mount->mnt_stat.f_fsidx; error = 0; switch ((int)ap->a_command) { case LFCNSEGWAITALL_COMPAT_50: case LFCNSEGWAITALL_COMPAT: fsidp = NULL; /* FALLSTHROUGH */ case LFCNSEGWAIT_COMPAT_50: case LFCNSEGWAIT_COMPAT: { struct timeval50 *tvp50 = (struct timeval50 *)ap->a_data; timeval50_to_timeval(tvp50, &tv); tvp = &tv; } goto segwait_common; case LFCNSEGWAITALL: fsidp = NULL; /* FALLSTHROUGH */ case LFCNSEGWAIT: tvp = (struct timeval *)ap->a_data; segwait_common: mutex_enter(&lfs_lock); ++fs->lfs_sleepers; mutex_exit(&lfs_lock); error = lfs_segwait(fsidp, tvp); mutex_enter(&lfs_lock); if (--fs->lfs_sleepers == 0) wakeup(&fs->lfs_sleepers); mutex_exit(&lfs_lock); return error; case LFCNBMAPV: case LFCNMARKV: blkvp = *(struct lfs_fcntl_markv *)ap->a_data; blkcnt = blkvp.blkcnt; if ((u_int) blkcnt > LFS_MARKV_MAXBLKCNT) return (EINVAL); blkiov = lfs_malloc(fs, blkcnt * sizeof(BLOCK_INFO), LFS_NB_BLKIOV); if ((error = copyin(blkvp.blkiov, blkiov, blkcnt * sizeof(BLOCK_INFO))) != 0) { lfs_free(fs, blkiov, LFS_NB_BLKIOV); return error; } mutex_enter(&lfs_lock); ++fs->lfs_sleepers; mutex_exit(&lfs_lock); if (ap->a_command == LFCNBMAPV) error = lfs_bmapv(l->l_proc, fsidp, blkiov, blkcnt); else /* LFCNMARKV */ error = lfs_markv(l->l_proc, fsidp, blkiov, blkcnt); if (error == 0) error = copyout(blkiov, blkvp.blkiov, blkcnt * sizeof(BLOCK_INFO)); mutex_enter(&lfs_lock); if (--fs->lfs_sleepers == 0) wakeup(&fs->lfs_sleepers); mutex_exit(&lfs_lock); lfs_free(fs, blkiov, LFS_NB_BLKIOV); return error; case LFCNRECLAIM: /* * Flush dirops and write Ifile, allowing empty segments * to be immediately reclaimed. */ lfs_writer_enter(fs, "pndirop"); off = fs->lfs_offset; lfs_seglock(fs, SEGM_FORCE_CKP | SEGM_CKP); lfs_flush_dirops(fs); LFS_CLEANERINFO(cip, fs, bp); oclean = cip->clean; LFS_SYNC_CLEANERINFO(cip, fs, bp, 1); lfs_segwrite(ap->a_vp->v_mount, SEGM_FORCE_CKP); fs->lfs_sp->seg_flags |= SEGM_PROT; lfs_segunlock(fs); lfs_writer_leave(fs); #ifdef DEBUG LFS_CLEANERINFO(cip, fs, bp); DLOG((DLOG_CLEAN, "lfs_fcntl: reclaim wrote %" PRId64 " blocks, cleaned %" PRId32 " segments (activesb %d)\n", fs->lfs_offset - off, cip->clean - oclean, fs->lfs_activesb)); LFS_SYNC_CLEANERINFO(cip, fs, bp, 0); #endif return 0; case LFCNIFILEFH_COMPAT: /* Return the filehandle of the Ifile */ if ((error = kauth_authorize_system(l->l_cred, KAUTH_SYSTEM_FILEHANDLE, 0, NULL, NULL, NULL)) != 0) return (error); fhp = (struct fhandle *)ap->a_data; fhp->fh_fsid = *fsidp; fh_size = 16; /* former VFS_MAXFIDSIZ */ return lfs_vptofh(fs->lfs_ivnode, &(fhp->fh_fid), &fh_size); case LFCNIFILEFH_COMPAT2: case LFCNIFILEFH: /* Return the filehandle of the Ifile */ fhp = (struct fhandle *)ap->a_data; fhp->fh_fsid = *fsidp; fh_size = sizeof(struct lfs_fhandle) - offsetof(fhandle_t, fh_fid); return lfs_vptofh(fs->lfs_ivnode, &(fhp->fh_fid), &fh_size); case LFCNREWIND: /* Move lfs_offset to the lowest-numbered segment */ return lfs_rewind(fs, *(int *)ap->a_data); case LFCNINVAL: /* Mark a segment SEGUSE_INVAL */ LFS_SEGENTRY(sup, fs, *(int *)ap->a_data, bp); if (sup->su_nbytes > 0) { brelse(bp, 0); lfs_unset_inval_all(fs); return EBUSY; } sup->su_flags |= SEGUSE_INVAL; VOP_BWRITE(bp->b_vp, bp); return 0; case LFCNRESIZE: /* Resize the filesystem */ return lfs_resize_fs(fs, *(int *)ap->a_data); case LFCNWRAPSTOP: case LFCNWRAPSTOP_COMPAT: /* * Hold lfs_newseg at segment 0; if requested, sleep until * the filesystem wraps around. To support external agents * (dump, fsck-based regression test) that need to look at * a snapshot of the filesystem, without necessarily * requiring that all fs activity stops. */ if (fs->lfs_stoplwp == curlwp) return EALREADY; mutex_enter(&lfs_lock); while (fs->lfs_stoplwp != NULL) cv_wait(&fs->lfs_stopcv, &lfs_lock); fs->lfs_stoplwp = curlwp; if (fs->lfs_nowrap == 0) log(LOG_NOTICE, "%s: disabled log wrap\n", fs->lfs_fsmnt); ++fs->lfs_nowrap; if (*(int *)ap->a_data == 1 || ap->a_command == LFCNWRAPSTOP_COMPAT) { log(LOG_NOTICE, "LFCNSTOPWRAP waiting for log wrap\n"); error = mtsleep(&fs->lfs_nowrap, PCATCH | PUSER, "segwrap", 0, &lfs_lock); log(LOG_NOTICE, "LFCNSTOPWRAP done waiting\n"); if (error) { lfs_wrapgo(fs, VTOI(ap->a_vp), 0); } } mutex_exit(&lfs_lock); return 0; case LFCNWRAPGO: case LFCNWRAPGO_COMPAT: /* * Having done its work, the agent wakes up the writer. * If the argument is 1, it sleeps until a new segment * is selected. */ mutex_enter(&lfs_lock); error = lfs_wrapgo(fs, VTOI(ap->a_vp), ap->a_command == LFCNWRAPGO_COMPAT ? 1 : *((int *)ap->a_data)); mutex_exit(&lfs_lock); return error; case LFCNWRAPPASS: if ((VTOI(ap->a_vp)->i_lfs_iflags & LFSI_WRAPWAIT)) return EALREADY; mutex_enter(&lfs_lock); if (fs->lfs_stoplwp != curlwp) { mutex_exit(&lfs_lock); return EALREADY; } if (fs->lfs_nowrap == 0) { mutex_exit(&lfs_lock); return EBUSY; } fs->lfs_wrappass = 1; wakeup(&fs->lfs_wrappass); /* Wait for the log to wrap, if asked */ if (*(int *)ap->a_data) { mutex_enter(ap->a_vp->v_interlock); if (lfs_vref(ap->a_vp) != 0) panic("LFCNWRAPPASS: lfs_vref failed"); VTOI(ap->a_vp)->i_lfs_iflags |= LFSI_WRAPWAIT; log(LOG_NOTICE, "LFCNPASS waiting for log wrap\n"); error = mtsleep(&fs->lfs_nowrap, PCATCH | PUSER, "segwrap", 0, &lfs_lock); log(LOG_NOTICE, "LFCNPASS done waiting\n"); VTOI(ap->a_vp)->i_lfs_iflags &= ~LFSI_WRAPWAIT; lfs_vunref(ap->a_vp); } mutex_exit(&lfs_lock); return error; case LFCNWRAPSTATUS: mutex_enter(&lfs_lock); *(int *)ap->a_data = fs->lfs_wrapstatus; mutex_exit(&lfs_lock); return 0; default: return ufs_fcntl(v); } return 0; } int lfs_getpages(void *v) { struct vop_getpages_args /* { struct vnode *a_vp; voff_t a_offset; struct vm_page **a_m; int *a_count; int a_centeridx; vm_prot_t a_access_type; int a_advice; int a_flags; } */ *ap = v; if (VTOI(ap->a_vp)->i_number == LFS_IFILE_INUM && (ap->a_access_type & VM_PROT_WRITE) != 0) { return EPERM; } if ((ap->a_access_type & VM_PROT_WRITE) != 0) { mutex_enter(&lfs_lock); LFS_SET_UINO(VTOI(ap->a_vp), IN_MODIFIED); mutex_exit(&lfs_lock); } /* * we're relying on the fact that genfs_getpages() always read in * entire filesystem blocks. */ return genfs_getpages(v); } /* * Wait for a page to become unbusy, possibly printing diagnostic messages * as well. * * Called with vp->v_interlock held; return with it held. */ static void wait_for_page(struct vnode *vp, struct vm_page *pg, const char *label) { KASSERT(mutex_owned(vp->v_interlock)); if ((pg->flags & PG_BUSY) == 0) return; /* Nothing to wait for! */ #if defined(DEBUG) && defined(UVM_PAGE_TRKOWN) static struct vm_page *lastpg; if (label != NULL && pg != lastpg) { if (pg->owner_tag) { printf("lfs_putpages[%d.%d]: %s: page %p owner %d.%d [%s]\n", curproc->p_pid, curlwp->l_lid, label, pg, pg->owner, pg->lowner, pg->owner_tag); } else { printf("lfs_putpages[%d.%d]: %s: page %p unowned?!\n", curproc->p_pid, curlwp->l_lid, label, pg); } } lastpg = pg; #endif pg->flags |= PG_WANTED; UVM_UNLOCK_AND_WAIT(pg, vp->v_interlock, 0, "lfsput", 0); mutex_enter(vp->v_interlock); } /* * This routine is called by lfs_putpages() when it can't complete the * write because a page is busy. This means that either (1) someone, * possibly the pagedaemon, is looking at this page, and will give it up * presently; or (2) we ourselves are holding the page busy in the * process of being written (either gathered or actually on its way to * disk). We don't need to give up the segment lock, but we might need * to call lfs_writeseg() to expedite the page's journey to disk. * * Called with vp->v_interlock held; return with it held. */ /* #define BUSYWAIT */ static void write_and_wait(struct lfs *fs, struct vnode *vp, struct vm_page *pg, int seglocked, const char *label) { KASSERT(mutex_owned(vp->v_interlock)); #ifndef BUSYWAIT struct inode *ip = VTOI(vp); struct segment *sp = fs->lfs_sp; int count = 0; if (pg == NULL) return; while (pg->flags & PG_BUSY && pg->uobject == &vp->v_uobj) { mutex_exit(vp->v_interlock); if (sp->cbpp - sp->bpp > 1) { /* Write gathered pages */ lfs_updatemeta(sp); lfs_release_finfo(fs); (void) lfs_writeseg(fs, sp); /* * Reinitialize FIP */ KASSERT(sp->vp == vp); lfs_acquire_finfo(fs, ip->i_number, ip->i_gen); } ++count; mutex_enter(vp->v_interlock); wait_for_page(vp, pg, label); } if (label != NULL && count > 1) { DLOG((DLOG_PAGE, "lfs_putpages[%d]: %s: %sn = %d\n", curproc->p_pid, label, (count > 0 ? "looping, " : ""), count)); } #else preempt(1); #endif KASSERT(mutex_owned(vp->v_interlock)); } /* * Make sure that for all pages in every block in the given range, * either all are dirty or all are clean. If any of the pages * we've seen so far are dirty, put the vnode on the paging chain, * and mark it IN_PAGING. * * If checkfirst != 0, don't check all the pages but return at the * first dirty page. */ static int check_dirty(struct lfs *fs, struct vnode *vp, off_t startoffset, off_t endoffset, off_t blkeof, int flags, int checkfirst, struct vm_page **pgp) { int by_list; struct vm_page *curpg = NULL; /* XXX: gcc */ struct vm_page *pgs[MAXBSIZE / PAGE_SIZE], *pg; off_t soff = 0; /* XXX: gcc */ voff_t off; int i; int nonexistent; int any_dirty; /* number of dirty pages */ int dirty; /* number of dirty pages in a block */ int tdirty; int pages_per_block = fs->lfs_bsize >> PAGE_SHIFT; int pagedaemon = (curlwp == uvm.pagedaemon_lwp); KASSERT(mutex_owned(vp->v_interlock)); ASSERT_MAYBE_SEGLOCK(fs); top: by_list = (vp->v_uobj.uo_npages <= ((endoffset - startoffset) >> PAGE_SHIFT) * UVM_PAGE_TREE_PENALTY); any_dirty = 0; if (by_list) { curpg = TAILQ_FIRST(&vp->v_uobj.memq); } else { soff = startoffset; } while (by_list || soff < MIN(blkeof, endoffset)) { if (by_list) { /* * Find the first page in a block. Skip * blocks outside our area of interest or beyond * the end of file. */ KASSERT(curpg == NULL || (curpg->flags & PG_MARKER) == 0); if (pages_per_block > 1) { while (curpg && ((curpg->offset & fs->lfs_bmask) || curpg->offset >= vp->v_size || curpg->offset >= endoffset)) { curpg = TAILQ_NEXT(curpg, listq.queue); KASSERT(curpg == NULL || (curpg->flags & PG_MARKER) == 0); } } if (curpg == NULL) break; soff = curpg->offset; } /* * Mark all pages in extended range busy; find out if any * of them are dirty. */ nonexistent = dirty = 0; for (i = 0; i == 0 || i < pages_per_block; i++) { KASSERT(mutex_owned(vp->v_interlock)); if (by_list && pages_per_block <= 1) { pgs[i] = pg = curpg; } else { off = soff + (i << PAGE_SHIFT); pgs[i] = pg = uvm_pagelookup(&vp->v_uobj, off); if (pg == NULL) { ++nonexistent; continue; } } KASSERT(pg != NULL); /* * If we're holding the segment lock, we can deadlock * against a process that has our page and is waiting * for the cleaner, while the cleaner waits for the * segment lock. Just bail in that case. */ if ((pg->flags & PG_BUSY) && (pagedaemon || LFS_SEGLOCK_HELD(fs))) { if (i > 0) uvm_page_unbusy(pgs, i); DLOG((DLOG_PAGE, "lfs_putpages: avoiding 3-way or pagedaemon deadlock\n")); if (pgp) *pgp = pg; KASSERT(mutex_owned(vp->v_interlock)); return -1; } while (pg->flags & PG_BUSY) { wait_for_page(vp, pg, NULL); KASSERT(mutex_owned(vp->v_interlock)); if (i > 0) uvm_page_unbusy(pgs, i); KASSERT(mutex_owned(vp->v_interlock)); goto top; } pg->flags |= PG_BUSY; UVM_PAGE_OWN(pg, "lfs_putpages"); pmap_page_protect(pg, VM_PROT_NONE); tdirty = (pmap_clear_modify(pg) || (pg->flags & PG_CLEAN) == 0); dirty += tdirty; } if (pages_per_block > 0 && nonexistent >= pages_per_block) { if (by_list) { curpg = TAILQ_NEXT(curpg, listq.queue); } else { soff += fs->lfs_bsize; } continue; } any_dirty += dirty; KASSERT(nonexistent == 0); KASSERT(mutex_owned(vp->v_interlock)); /* * If any are dirty make all dirty; unbusy them, * but if we were asked to clean, wire them so that * the pagedaemon doesn't bother us about them while * they're on their way to disk. */ for (i = 0; i == 0 || i < pages_per_block; i++) { KASSERT(mutex_owned(vp->v_interlock)); pg = pgs[i]; KASSERT(!((pg->flags & PG_CLEAN) && (pg->flags & PG_DELWRI))); KASSERT(pg->flags & PG_BUSY); if (dirty) { pg->flags &= ~PG_CLEAN; if (flags & PGO_FREE) { /* * Wire the page so that * pdaemon doesn't see it again. */ mutex_enter(&uvm_pageqlock); uvm_pagewire(pg); mutex_exit(&uvm_pageqlock); /* Suspended write flag */ pg->flags |= PG_DELWRI; } } if (pg->flags & PG_WANTED) wakeup(pg); pg->flags &= ~(PG_WANTED|PG_BUSY); UVM_PAGE_OWN(pg, NULL); } if (checkfirst && any_dirty) break; if (by_list) { curpg = TAILQ_NEXT(curpg, listq.queue); } else { soff += MAX(PAGE_SIZE, fs->lfs_bsize); } } KASSERT(mutex_owned(vp->v_interlock)); return any_dirty; } /* * lfs_putpages functions like genfs_putpages except that * * (1) It needs to bounds-check the incoming requests to ensure that * they are block-aligned; if they are not, expand the range and * do the right thing in case, e.g., the requested range is clean * but the expanded range is dirty. * * (2) It needs to explicitly send blocks to be written when it is done. * If VOP_PUTPAGES is called without the seglock held, we simply take * the seglock and let lfs_segunlock wait for us. * XXX There might be a bad situation if we have to flush a vnode while * XXX lfs_markv is in operation. As of this writing we panic in this * XXX case. * * Assumptions: * * (1) The caller does not hold any pages in this vnode busy. If it does, * there is a danger that when we expand the page range and busy the * pages we will deadlock. * * (2) We are called with vp->v_interlock held; we must return with it * released. * * (3) We don't absolutely have to free pages right away, provided that * the request does not have PGO_SYNCIO. When the pagedaemon gives * us a request with PGO_FREE, we take the pages out of the paging * queue and wake up the writer, which will handle freeing them for us. * * We ensure that for any filesystem block, all pages for that * block are either resident or not, even if those pages are higher * than EOF; that means that we will be getting requests to free * "unused" pages above EOF all the time, and should ignore them. * * (4) If we are called with PGO_LOCKED, the finfo array we are to write * into has been set up for us by lfs_writefile. If not, we will * have to handle allocating and/or freeing an finfo entry. * * XXX note that we're (ab)using PGO_LOCKED as "seglock held". */ /* How many times to loop before we should start to worry */ #define TOOMANY 4 int lfs_putpages(void *v) { int error; struct vop_putpages_args /* { struct vnode *a_vp; voff_t a_offlo; voff_t a_offhi; int a_flags; } */ *ap = v; struct vnode *vp; struct inode *ip; struct lfs *fs; struct segment *sp; off_t origoffset, startoffset, endoffset, origendoffset, blkeof; off_t off, max_endoffset; bool seglocked, sync, pagedaemon, reclaim; struct vm_page *pg, *busypg; UVMHIST_FUNC("lfs_putpages"); UVMHIST_CALLED(ubchist); int oreclaim = 0; int donewriting = 0; #ifdef DEBUG int debug_n_again, debug_n_dirtyclean; #endif vp = ap->a_vp; ip = VTOI(vp); fs = ip->i_lfs; sync = (ap->a_flags & PGO_SYNCIO) != 0; reclaim = (ap->a_flags & PGO_RECLAIM) != 0; pagedaemon = (curlwp == uvm.pagedaemon_lwp); KASSERT(mutex_owned(vp->v_interlock)); /* Putpages does nothing for metadata. */ if (vp == fs->lfs_ivnode || vp->v_type != VREG) { mutex_exit(vp->v_interlock); return 0; } /* * If there are no pages, don't do anything. */ if (vp->v_uobj.uo_npages == 0) { if (TAILQ_EMPTY(&vp->v_uobj.memq) && (vp->v_iflag & VI_ONWORKLST) && LIST_FIRST(&vp->v_dirtyblkhd) == NULL) { vp->v_iflag &= ~VI_WRMAPDIRTY; vn_syncer_remove_from_worklist(vp); } mutex_exit(vp->v_interlock); /* Remove us from paging queue, if we were on it */ mutex_enter(&lfs_lock); if (ip->i_flags & IN_PAGING) { ip->i_flags &= ~IN_PAGING; TAILQ_REMOVE(&fs->lfs_pchainhd, ip, i_lfs_pchain); } mutex_exit(&lfs_lock); KASSERT(!mutex_owned(vp->v_interlock)); return 0; } blkeof = blkroundup(fs, ip->i_size); /* * Ignore requests to free pages past EOF but in the same block * as EOF, unless the vnode is being reclaimed or the request * is synchronous. (If the request is sync, it comes from * lfs_truncate.) * * To avoid being flooded with this request, make these pages * look "active". */ if (!sync && !reclaim && ap->a_offlo >= ip->i_size && ap->a_offlo < blkeof) { origoffset = ap->a_offlo; for (off = origoffset; off < blkeof; off += fs->lfs_bsize) { pg = uvm_pagelookup(&vp->v_uobj, off); KASSERT(pg != NULL); while (pg->flags & PG_BUSY) { pg->flags |= PG_WANTED; UVM_UNLOCK_AND_WAIT(pg, vp->v_interlock, 0, "lfsput2", 0); mutex_enter(vp->v_interlock); } mutex_enter(&uvm_pageqlock); uvm_pageactivate(pg); mutex_exit(&uvm_pageqlock); } ap->a_offlo = blkeof; if (ap->a_offhi > 0 && ap->a_offhi <= ap->a_offlo) { mutex_exit(vp->v_interlock); return 0; } } /* * Extend page range to start and end at block boundaries. * (For the purposes of VOP_PUTPAGES, fragments don't exist.) */ origoffset = ap->a_offlo; origendoffset = ap->a_offhi; startoffset = origoffset & ~(fs->lfs_bmask); max_endoffset = (trunc_page(LLONG_MAX) >> fs->lfs_bshift) << fs->lfs_bshift; if (origendoffset == 0 || ap->a_flags & PGO_ALLPAGES) { endoffset = max_endoffset; origendoffset = endoffset; } else { origendoffset = round_page(ap->a_offhi); endoffset = round_page(blkroundup(fs, origendoffset)); } KASSERT(startoffset > 0 || endoffset >= startoffset); if (startoffset == endoffset) { /* Nothing to do, why were we called? */ mutex_exit(vp->v_interlock); DLOG((DLOG_PAGE, "lfs_putpages: startoffset = endoffset = %" PRId64 "\n", startoffset)); return 0; } ap->a_offlo = startoffset; ap->a_offhi = endoffset; /* * If not cleaning, just send the pages through genfs_putpages * to be returned to the pool. */ if (!(ap->a_flags & PGO_CLEANIT)) { DLOG((DLOG_PAGE, "lfs_putpages: no cleanit vn %p ino %d (flags %x)\n", vp, (int)ip->i_number, ap->a_flags)); int r = genfs_putpages(v); KASSERT(!mutex_owned(vp->v_interlock)); return r; } /* Set PGO_BUSYFAIL to avoid deadlocks */ ap->a_flags |= PGO_BUSYFAIL; /* * Likewise, if we are asked to clean but the pages are not * dirty, we can just free them using genfs_putpages. */ #ifdef DEBUG debug_n_dirtyclean = 0; #endif do { int r; KASSERT(mutex_owned(vp->v_interlock)); /* Count the number of dirty pages */ r = check_dirty(fs, vp, startoffset, endoffset, blkeof, ap->a_flags, 1, NULL); if (r < 0) { /* Pages are busy with another process */ mutex_exit(vp->v_interlock); return EDEADLK; } if (r > 0) /* Some pages are dirty */ break; /* * Sometimes pages are dirtied between the time that * we check and the time we try to clean them. * Instruct lfs_gop_write to return EDEADLK in this case * so we can write them properly. */ ip->i_lfs_iflags |= LFSI_NO_GOP_WRITE; r = genfs_do_putpages(vp, startoffset, endoffset, ap->a_flags & ~PGO_SYNCIO, &busypg); ip->i_lfs_iflags &= ~LFSI_NO_GOP_WRITE; if (r != EDEADLK) { KASSERT(!mutex_owned(vp->v_interlock)); return r; } /* One of the pages was busy. Start over. */ mutex_enter(vp->v_interlock); wait_for_page(vp, busypg, "dirtyclean"); #ifdef DEBUG ++debug_n_dirtyclean; #endif } while(1); #ifdef DEBUG if (debug_n_dirtyclean > TOOMANY) DLOG((DLOG_PAGE, "lfs_putpages: dirtyclean: looping, n = %d\n", debug_n_dirtyclean)); #endif /* * Dirty and asked to clean. * * Pagedaemon can't actually write LFS pages; wake up * the writer to take care of that. The writer will * notice the pager inode queue and act on that. * * XXX We must drop the vp->interlock before taking the lfs_lock or we * get a nasty deadlock with lfs_flush_pchain(). */ if (pagedaemon) { mutex_exit(vp->v_interlock); mutex_enter(&lfs_lock); if (!(ip->i_flags & IN_PAGING)) { ip->i_flags |= IN_PAGING; TAILQ_INSERT_TAIL(&fs->lfs_pchainhd, ip, i_lfs_pchain); } wakeup(&lfs_writer_daemon); mutex_exit(&lfs_lock); preempt(); KASSERT(!mutex_owned(vp->v_interlock)); return EWOULDBLOCK; } /* * If this is a file created in a recent dirop, we can't flush its * inode until the dirop is complete. Drain dirops, then flush the * filesystem (taking care of any other pending dirops while we're * at it). */ if ((ap->a_flags & (PGO_CLEANIT|PGO_LOCKED)) == PGO_CLEANIT && (vp->v_uflag & VU_DIROP)) { DLOG((DLOG_PAGE, "lfs_putpages: flushing VU_DIROP\n")); lfs_writer_enter(fs, "ppdirop"); /* Note if we hold the vnode locked */ if (VOP_ISLOCKED(vp) == LK_EXCLUSIVE) { DLOG((DLOG_PAGE, "lfs_putpages: dirop inode already locked\n")); } else { DLOG((DLOG_PAGE, "lfs_putpages: dirop inode not locked\n")); } mutex_exit(vp->v_interlock); mutex_enter(&lfs_lock); lfs_flush_fs(fs, sync ? SEGM_SYNC : 0); mutex_exit(&lfs_lock); mutex_enter(vp->v_interlock); lfs_writer_leave(fs); /* The flush will have cleaned out this vnode as well, no need to do more to it. */ } /* * This is it. We are going to write some pages. From here on * down it's all just mechanics. * * Don't let genfs_putpages wait; lfs_segunlock will wait for us. */ ap->a_flags &= ~PGO_SYNCIO; /* * If we've already got the seglock, flush the node and return. * The FIP has already been set up for us by lfs_writefile, * and FIP cleanup and lfs_updatemeta will also be done there, * unless genfs_putpages returns EDEADLK; then we must flush * what we have, and correct FIP and segment header accounting. */ get_seglock: /* * If we are not called with the segment locked, lock it. * Account for a new FIP in the segment header, and set sp->vp. * (This should duplicate the setup at the top of lfs_writefile().) */ seglocked = (ap->a_flags & PGO_LOCKED) != 0; if (!seglocked) { mutex_exit(vp->v_interlock); error = lfs_seglock(fs, SEGM_PROT | (sync ? SEGM_SYNC : 0)); if (error != 0) { KASSERT(!mutex_owned(vp->v_interlock)); return error; } mutex_enter(vp->v_interlock); lfs_acquire_finfo(fs, ip->i_number, ip->i_gen); } sp = fs->lfs_sp; KASSERT(sp->vp == NULL); sp->vp = vp; /* Note segments written by reclaim; only for debugging */ if ((vp->v_iflag & VI_XLOCK) != 0) { sp->seg_flags |= SEGM_RECLAIM; fs->lfs_reclino = ip->i_number; } /* * Ensure that the partial segment is marked SS_DIROP if this * vnode is a DIROP. */ if (!seglocked && vp->v_uflag & VU_DIROP) ((SEGSUM *)(sp->segsum))->ss_flags |= (SS_DIROP|SS_CONT); /* * Loop over genfs_putpages until all pages are gathered. * genfs_putpages() drops the interlock, so reacquire it if necessary. * Whenever we lose the interlock we have to rerun check_dirty, as * well, since more pages might have been dirtied in our absence. */ #ifdef DEBUG debug_n_again = 0; #endif do { busypg = NULL; KASSERT(mutex_owned(vp->v_interlock)); if (check_dirty(fs, vp, startoffset, endoffset, blkeof, ap->a_flags, 0, &busypg) < 0) { mutex_exit(vp->v_interlock); /* XXX why? --ks */ mutex_enter(vp->v_interlock); write_and_wait(fs, vp, busypg, seglocked, NULL); if (!seglocked) { mutex_exit(vp->v_interlock); lfs_release_finfo(fs); lfs_segunlock(fs); mutex_enter(vp->v_interlock); } sp->vp = NULL; goto get_seglock; } busypg = NULL; KASSERT(!mutex_owned(&uvm_pageqlock)); oreclaim = (ap->a_flags & PGO_RECLAIM); ap->a_flags &= ~PGO_RECLAIM; error = genfs_do_putpages(vp, startoffset, endoffset, ap->a_flags, &busypg); ap->a_flags |= oreclaim; if (error == EDEADLK || error == EAGAIN) { DLOG((DLOG_PAGE, "lfs_putpages: genfs_putpages returned" " %d ino %d off %x (seg %d)\n", error, ip->i_number, fs->lfs_offset, dtosn(fs, fs->lfs_offset))); if (oreclaim) { mutex_enter(vp->v_interlock); write_and_wait(fs, vp, busypg, seglocked, "again"); mutex_exit(vp->v_interlock); } else { if ((sp->seg_flags & SEGM_SINGLE) && fs->lfs_curseg != fs->lfs_startseg) donewriting = 1; } } else if (error) { DLOG((DLOG_PAGE, "lfs_putpages: genfs_putpages returned" " %d ino %d off %x (seg %d)\n", error, (int)ip->i_number, fs->lfs_offset, dtosn(fs, fs->lfs_offset))); } /* genfs_do_putpages loses the interlock */ #ifdef DEBUG ++debug_n_again; #endif if (oreclaim && error == EAGAIN) { DLOG((DLOG_PAGE, "vp %p ino %d vi_flags %x a_flags %x avoiding vclean panic\n", vp, (int)ip->i_number, vp->v_iflag, ap->a_flags)); mutex_enter(vp->v_interlock); } if (error == EDEADLK) mutex_enter(vp->v_interlock); } while (error == EDEADLK || (oreclaim && error == EAGAIN)); #ifdef DEBUG if (debug_n_again > TOOMANY) DLOG((DLOG_PAGE, "lfs_putpages: again: looping, n = %d\n", debug_n_again)); #endif KASSERT(sp != NULL && sp->vp == vp); if (!seglocked && !donewriting) { sp->vp = NULL; /* Write indirect blocks as well */ lfs_gather(fs, fs->lfs_sp, vp, lfs_match_indir); lfs_gather(fs, fs->lfs_sp, vp, lfs_match_dindir); lfs_gather(fs, fs->lfs_sp, vp, lfs_match_tindir); KASSERT(sp->vp == NULL); sp->vp = vp; } /* * Blocks are now gathered into a segment waiting to be written. * All that's left to do is update metadata, and write them. */ lfs_updatemeta(sp); KASSERT(sp->vp == vp); sp->vp = NULL; /* * If we were called from lfs_writefile, we don't need to clean up * the FIP or unlock the segment lock. We're done. */ if (seglocked) { KASSERT(!mutex_owned(vp->v_interlock)); return error; } /* Clean up FIP and send it to disk. */ lfs_release_finfo(fs); lfs_writeseg(fs, fs->lfs_sp); /* * Remove us from paging queue if we wrote all our pages. */ if (origendoffset == 0 || ap->a_flags & PGO_ALLPAGES) { mutex_enter(&lfs_lock); if (ip->i_flags & IN_PAGING) { ip->i_flags &= ~IN_PAGING; TAILQ_REMOVE(&fs->lfs_pchainhd, ip, i_lfs_pchain); } mutex_exit(&lfs_lock); } /* * XXX - with the malloc/copy writeseg, the pages are freed by now * even if we don't wait (e.g. if we hold a nested lock). This * will not be true if we stop using malloc/copy. */ KASSERT(fs->lfs_sp->seg_flags & SEGM_PROT); lfs_segunlock(fs); /* * Wait for v_numoutput to drop to zero. The seglock should * take care of this, but there is a slight possibility that * aiodoned might not have got around to our buffers yet. */ if (sync) { mutex_enter(vp->v_interlock); while (vp->v_numoutput > 0) { DLOG((DLOG_PAGE, "lfs_putpages: ino %d sleeping on" " num %d\n", ip->i_number, vp->v_numoutput)); cv_wait(&vp->v_cv, vp->v_interlock); } mutex_exit(vp->v_interlock); } KASSERT(!mutex_owned(vp->v_interlock)); return error; } /* * Return the last logical file offset that should be written for this file * if we're doing a write that ends at "size". If writing, we need to know * about sizes on disk, i.e. fragments if there are any; if reading, we need * to know about entire blocks. */ void lfs_gop_size(struct vnode *vp, off_t size, off_t *eobp, int flags) { struct inode *ip = VTOI(vp); struct lfs *fs = ip->i_lfs; daddr_t olbn, nlbn; olbn = lblkno(fs, ip->i_size); nlbn = lblkno(fs, size); if (!(flags & GOP_SIZE_MEM) && nlbn < NDADDR && olbn <= nlbn) { *eobp = fragroundup(fs, size); } else { *eobp = blkroundup(fs, size); } } #ifdef DEBUG void lfs_dump_vop(void *); void lfs_dump_vop(void *v) { struct vop_putpages_args /* { struct vnode *a_vp; voff_t a_offlo; voff_t a_offhi; int a_flags; } */ *ap = v; #ifdef DDB vfs_vnode_print(ap->a_vp, 0, printf); #endif lfs_dump_dinode(VTOI(ap->a_vp)->i_din.ffs1_din); } #endif int lfs_mmap(void *v) { struct vop_mmap_args /* { const struct vnodeop_desc *a_desc; struct vnode *a_vp; vm_prot_t a_prot; kauth_cred_t a_cred; } */ *ap = v; if (VTOI(ap->a_vp)->i_number == LFS_IFILE_INUM) return EOPNOTSUPP; return ufs_mmap(v); }