- Fix for possible unset uid/gid in toproto - Fix for default mtree style - Update libelf - Importing libexecinfo - Resynchronize GCC, mpc, gmp, mpfr - build.sh: Replace params with show-params. This has been done as the make target has been renamed in the same way, while a new target named params has been added. This new target generates a file containing all the parameters, instead of printing it on the console. - Update test48 with new etc/services (Fix by Ben Gras <ben@minix3.org) get getservbyport() out of the inner loop Change-Id: Ie6ad5226fa2621ff9f0dee8782ea48f9443d2091
1526 lines
45 KiB
C
1526 lines
45 KiB
C
/* $NetBSD: ulfs_lookup.c,v 1.17 2013/10/25 20:05:39 martin Exp $ */
|
|
/* from NetBSD: ufs_lookup.c,v 1.122 2013/01/22 09:39:18 dholland Exp */
|
|
|
|
/*
|
|
* Copyright (c) 1989, 1993
|
|
* The Regents of the University of California. All rights reserved.
|
|
* (c) UNIX System Laboratories, Inc.
|
|
* All or some portions of this file are derived from material licensed
|
|
* to the University of California by American Telephone and Telegraph
|
|
* Co. or Unix System Laboratories, Inc. and are reproduced herein with
|
|
* the permission of UNIX System Laboratories, Inc.
|
|
*
|
|
* 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.
|
|
*
|
|
* @(#)ufs_lookup.c 8.9 (Berkeley) 8/11/94
|
|
*/
|
|
|
|
#include <sys/cdefs.h>
|
|
__KERNEL_RCSID(0, "$NetBSD: ulfs_lookup.c,v 1.17 2013/10/25 20:05:39 martin Exp $");
|
|
|
|
#ifdef _KERNEL_OPT
|
|
#include "opt_lfs.h"
|
|
#endif
|
|
|
|
#include <sys/param.h>
|
|
#include <sys/systm.h>
|
|
#include <sys/namei.h>
|
|
#include <sys/buf.h>
|
|
#include <sys/file.h>
|
|
#include <sys/stat.h>
|
|
#include <sys/mount.h>
|
|
#include <sys/vnode.h>
|
|
#include <sys/kernel.h>
|
|
#include <sys/kauth.h>
|
|
#include <sys/wapbl.h>
|
|
#include <sys/fstrans.h>
|
|
#include <sys/proc.h>
|
|
#include <sys/kmem.h>
|
|
|
|
#include <ufs/lfs/lfs_extern.h>
|
|
|
|
#include <ufs/lfs/ulfs_inode.h>
|
|
#ifdef LFS_DIRHASH
|
|
#include <ufs/lfs/ulfs_dirhash.h>
|
|
#endif
|
|
#include <ufs/lfs/ulfsmount.h>
|
|
#include <ufs/lfs/ulfs_extern.h>
|
|
#include <ufs/lfs/ulfs_bswap.h>
|
|
|
|
#include <miscfs/genfs/genfs.h>
|
|
|
|
#ifdef DIAGNOSTIC
|
|
int lfs_dirchk = 1;
|
|
#else
|
|
int lfs_dirchk = 0;
|
|
#endif
|
|
|
|
/*
|
|
* Convert a component of a pathname into a pointer to a locked inode.
|
|
* This is a very central and rather complicated routine.
|
|
* If the file system is not maintained in a strict tree hierarchy,
|
|
* this can result in a deadlock situation (see comments in code below).
|
|
*
|
|
* The cnp->cn_nameiop argument is LOOKUP, CREATE, RENAME, or DELETE depending
|
|
* on whether the name is to be looked up, created, renamed, or deleted.
|
|
* When CREATE, RENAME, or DELETE is specified, information usable in
|
|
* creating, renaming, or deleting a directory entry may be calculated.
|
|
* If flag has LOCKPARENT or'ed into it and the target of the pathname
|
|
* exists, lookup returns both the target and its parent directory locked.
|
|
* When creating or renaming and LOCKPARENT is specified, the target may
|
|
* not be ".". When deleting and LOCKPARENT is specified, the target may
|
|
* be "."., but the caller must check to ensure it does an vrele and vput
|
|
* instead of two vputs.
|
|
*
|
|
* Overall outline of ulfs_lookup:
|
|
*
|
|
* check accessibility of directory
|
|
* look for name in cache, if found, then if at end of path
|
|
* and deleting or creating, drop it, else return name
|
|
* search for name in directory, to found or notfound
|
|
* notfound:
|
|
* if creating, return locked directory, leaving info on available slots
|
|
* else return error
|
|
* found:
|
|
* if at end of path and deleting, return information to allow delete
|
|
* if at end of path and rewriting (RENAME and LOCKPARENT), lock target
|
|
* inode and return info to allow rewrite
|
|
* if not at end, add name to cache; if at end and neither creating
|
|
* nor deleting, add name to cache
|
|
*/
|
|
int
|
|
ulfs_lookup(void *v)
|
|
{
|
|
struct vop_lookup_args /* {
|
|
struct vnode *a_dvp;
|
|
struct vnode **a_vpp;
|
|
struct componentname *a_cnp;
|
|
} */ *ap = v;
|
|
struct vnode *vdp = ap->a_dvp; /* vnode for directory being searched */
|
|
struct inode *dp = VTOI(vdp); /* inode for directory being searched */
|
|
struct buf *bp; /* a buffer of directory entries */
|
|
struct lfs_direct *ep; /* the current directory entry */
|
|
int entryoffsetinblock; /* offset of ep in bp's buffer */
|
|
enum {
|
|
NONE, /* need to search a slot for our new entry */
|
|
COMPACT, /* a compaction can make a slot in the current
|
|
DIRBLKSIZ block */
|
|
FOUND, /* found a slot (or no need to search) */
|
|
} slotstatus;
|
|
doff_t slotoffset; /* offset of area with free space.
|
|
a special value -1 for invalid */
|
|
int slotsize; /* size of area at slotoffset */
|
|
int slotfreespace; /* accumulated amount of space free in
|
|
the current DIRBLKSIZ block */
|
|
int slotneeded; /* size of the entry we're seeking */
|
|
int numdirpasses; /* strategy for directory search */
|
|
doff_t endsearch; /* offset to end directory search */
|
|
doff_t prevoff; /* previous value of ulr_offset */
|
|
struct vnode *pdp; /* saved dp during symlink work */
|
|
struct vnode *tdp; /* returned by VFS_VGET */
|
|
doff_t enduseful; /* pointer past last used dir slot.
|
|
used for directory truncation. */
|
|
u_long bmask; /* block offset mask */
|
|
int error;
|
|
struct vnode **vpp = ap->a_vpp;
|
|
struct componentname *cnp = ap->a_cnp;
|
|
kauth_cred_t cred = cnp->cn_cred;
|
|
int flags;
|
|
int nameiop = cnp->cn_nameiop;
|
|
struct lfs *fs = dp->i_lfs;
|
|
const int needswap = ULFS_MPNEEDSWAP(fs);
|
|
int dirblksiz = fs->um_dirblksiz;
|
|
ino_t foundino;
|
|
struct ulfs_lookup_results *results;
|
|
int iswhiteout; /* temp result from cache_lookup() */
|
|
|
|
flags = cnp->cn_flags;
|
|
|
|
bp = NULL;
|
|
slotoffset = -1;
|
|
*vpp = NULL;
|
|
endsearch = 0; /* silence compiler warning */
|
|
|
|
/*
|
|
* Produce the auxiliary lookup results into i_crap. Increment
|
|
* its serial number so elsewhere we can tell if we're using
|
|
* stale results. This should not be done this way. XXX.
|
|
*/
|
|
results = &dp->i_crap;
|
|
dp->i_crapcounter++;
|
|
|
|
/*
|
|
* Check accessiblity of directory.
|
|
*/
|
|
if ((error = VOP_ACCESS(vdp, VEXEC, cred)) != 0)
|
|
return (error);
|
|
|
|
if ((flags & ISLASTCN) && (vdp->v_mount->mnt_flag & MNT_RDONLY) &&
|
|
(nameiop == DELETE || nameiop == RENAME))
|
|
return (EROFS);
|
|
|
|
/*
|
|
* We now have a segment name to search for, and a directory to search.
|
|
*
|
|
* Before tediously performing a linear scan of the directory,
|
|
* check the name cache to see if the directory/name pair
|
|
* we are looking for is known already.
|
|
*/
|
|
if (cache_lookup(vdp, cnp->cn_nameptr, cnp->cn_namelen,
|
|
cnp->cn_nameiop, cnp->cn_flags, &iswhiteout, vpp)) {
|
|
if (iswhiteout) {
|
|
cnp->cn_flags |= ISWHITEOUT;
|
|
}
|
|
return *vpp == NULLVP ? ENOENT : 0;
|
|
}
|
|
if (iswhiteout) {
|
|
/*
|
|
* The namecache set iswhiteout without finding a
|
|
* cache entry. As of this writing (20121014), this
|
|
* can happen if there was a whiteout entry that has
|
|
* been invalidated by the lookup. It is not clear if
|
|
* it is correct to set ISWHITEOUT in this case or
|
|
* not; however, doing so retains the prior behavior,
|
|
* so we'll go with that until some clearer answer
|
|
* appears. XXX
|
|
*/
|
|
cnp->cn_flags |= ISWHITEOUT;
|
|
}
|
|
|
|
fstrans_start(vdp->v_mount, FSTRANS_SHARED);
|
|
|
|
/*
|
|
* Suppress search for slots unless creating
|
|
* file and at end of pathname, in which case
|
|
* we watch for a place to put the new file in
|
|
* case it doesn't already exist.
|
|
*/
|
|
slotstatus = FOUND;
|
|
slotfreespace = slotsize = slotneeded = 0;
|
|
if ((nameiop == CREATE || nameiop == RENAME) && (flags & ISLASTCN)) {
|
|
slotstatus = NONE;
|
|
slotneeded = LFS_DIRECTSIZ(cnp->cn_namelen);
|
|
}
|
|
|
|
/*
|
|
* If there is cached information on a previous search of
|
|
* this directory, pick up where we last left off.
|
|
* We cache only lookups as these are the most common
|
|
* and have the greatest payoff. Caching CREATE has little
|
|
* benefit as it usually must search the entire directory
|
|
* to determine that the entry does not exist. Caching the
|
|
* location of the last DELETE or RENAME has not reduced
|
|
* profiling time and hence has been removed in the interest
|
|
* of simplicity.
|
|
*/
|
|
bmask = vdp->v_mount->mnt_stat.f_iosize - 1;
|
|
|
|
#ifdef LFS_DIRHASH
|
|
/*
|
|
* Use dirhash for fast operations on large directories. The logic
|
|
* to determine whether to hash the directory is contained within
|
|
* ulfsdirhash_build(); a zero return means that it decided to hash
|
|
* this directory and it successfully built up the hash table.
|
|
*/
|
|
if (ulfsdirhash_build(dp) == 0) {
|
|
/* Look for a free slot if needed. */
|
|
enduseful = dp->i_size;
|
|
if (slotstatus != FOUND) {
|
|
slotoffset = ulfsdirhash_findfree(dp, slotneeded,
|
|
&slotsize);
|
|
if (slotoffset >= 0) {
|
|
slotstatus = COMPACT;
|
|
enduseful = ulfsdirhash_enduseful(dp);
|
|
if (enduseful < 0)
|
|
enduseful = dp->i_size;
|
|
}
|
|
}
|
|
/* Look up the component. */
|
|
numdirpasses = 1;
|
|
entryoffsetinblock = 0; /* silence compiler warning */
|
|
switch (ulfsdirhash_lookup(dp, cnp->cn_nameptr, cnp->cn_namelen,
|
|
&results->ulr_offset, &bp, nameiop == DELETE ? &prevoff : NULL)) {
|
|
case 0:
|
|
ep = (struct lfs_direct *)((char *)bp->b_data +
|
|
(results->ulr_offset & bmask));
|
|
goto foundentry;
|
|
case ENOENT:
|
|
results->ulr_offset = roundup(dp->i_size, dirblksiz);
|
|
goto notfound;
|
|
default:
|
|
/* Something failed; just do a linear search. */
|
|
break;
|
|
}
|
|
}
|
|
#endif /* LFS_DIRHASH */
|
|
|
|
if (nameiop != LOOKUP || results->ulr_diroff == 0 ||
|
|
results->ulr_diroff >= dp->i_size) {
|
|
entryoffsetinblock = 0;
|
|
results->ulr_offset = 0;
|
|
numdirpasses = 1;
|
|
} else {
|
|
results->ulr_offset = results->ulr_diroff;
|
|
if ((entryoffsetinblock = results->ulr_offset & bmask) &&
|
|
(error = ulfs_blkatoff(vdp, (off_t)results->ulr_offset,
|
|
NULL, &bp, false)))
|
|
goto out;
|
|
numdirpasses = 2;
|
|
nchstats.ncs_2passes++;
|
|
}
|
|
prevoff = results->ulr_offset;
|
|
endsearch = roundup(dp->i_size, dirblksiz);
|
|
enduseful = 0;
|
|
|
|
searchloop:
|
|
while (results->ulr_offset < endsearch) {
|
|
if (curcpu()->ci_schedstate.spc_flags & SPCF_SHOULDYIELD)
|
|
preempt();
|
|
/*
|
|
* If necessary, get the next directory block.
|
|
*/
|
|
if ((results->ulr_offset & bmask) == 0) {
|
|
if (bp != NULL)
|
|
brelse(bp, 0);
|
|
error = ulfs_blkatoff(vdp, (off_t)results->ulr_offset,
|
|
NULL, &bp, false);
|
|
if (error)
|
|
goto out;
|
|
entryoffsetinblock = 0;
|
|
}
|
|
/*
|
|
* If still looking for a slot, and at a DIRBLKSIZ
|
|
* boundary, have to start looking for free space again.
|
|
*/
|
|
if (slotstatus == NONE &&
|
|
(entryoffsetinblock & (dirblksiz - 1)) == 0) {
|
|
slotoffset = -1;
|
|
slotfreespace = 0;
|
|
}
|
|
/*
|
|
* Get pointer to next entry.
|
|
* Full validation checks are slow, so we only check
|
|
* enough to insure forward progress through the
|
|
* directory. Complete checks can be run by patching
|
|
* "lfs_dirchk" to be true.
|
|
*/
|
|
KASSERT(bp != NULL);
|
|
ep = (struct lfs_direct *)((char *)bp->b_data + entryoffsetinblock);
|
|
if (ep->d_reclen == 0 ||
|
|
(lfs_dirchk && ulfs_dirbadentry(vdp, ep, entryoffsetinblock))) {
|
|
int i;
|
|
|
|
ulfs_dirbad(dp, results->ulr_offset, "mangled entry");
|
|
i = dirblksiz - (entryoffsetinblock & (dirblksiz - 1));
|
|
results->ulr_offset += i;
|
|
entryoffsetinblock += i;
|
|
continue;
|
|
}
|
|
|
|
/*
|
|
* If an appropriate sized slot has not yet been found,
|
|
* check to see if one is available. Also accumulate space
|
|
* in the current block so that we can determine if
|
|
* compaction is viable.
|
|
*/
|
|
if (slotstatus != FOUND) {
|
|
int size = ulfs_rw16(ep->d_reclen, needswap);
|
|
|
|
if (ep->d_ino != 0)
|
|
size -= LFS_DIRSIZ(FSFMT(vdp), ep, needswap);
|
|
if (size > 0) {
|
|
if (size >= slotneeded) {
|
|
slotstatus = FOUND;
|
|
slotoffset = results->ulr_offset;
|
|
slotsize = ulfs_rw16(ep->d_reclen,
|
|
needswap);
|
|
} else if (slotstatus == NONE) {
|
|
slotfreespace += size;
|
|
if (slotoffset == -1)
|
|
slotoffset = results->ulr_offset;
|
|
if (slotfreespace >= slotneeded) {
|
|
slotstatus = COMPACT;
|
|
slotsize = results->ulr_offset +
|
|
ulfs_rw16(ep->d_reclen,
|
|
needswap) -
|
|
slotoffset;
|
|
}
|
|
}
|
|
}
|
|
}
|
|
|
|
/*
|
|
* Check for a name match.
|
|
*/
|
|
if (ep->d_ino) {
|
|
int namlen;
|
|
|
|
#if (BYTE_ORDER == LITTLE_ENDIAN)
|
|
if (FSFMT(vdp) && needswap == 0)
|
|
namlen = ep->d_type;
|
|
else
|
|
namlen = ep->d_namlen;
|
|
#else
|
|
if (FSFMT(vdp) && needswap != 0)
|
|
namlen = ep->d_type;
|
|
else
|
|
namlen = ep->d_namlen;
|
|
#endif
|
|
if (namlen == cnp->cn_namelen &&
|
|
!memcmp(cnp->cn_nameptr, ep->d_name,
|
|
(unsigned)namlen)) {
|
|
#ifdef LFS_DIRHASH
|
|
foundentry:
|
|
#endif
|
|
/*
|
|
* Save directory entry's inode number and
|
|
* reclen, and release directory buffer.
|
|
*/
|
|
if (!FSFMT(vdp) && ep->d_type == LFS_DT_WHT) {
|
|
slotstatus = FOUND;
|
|
slotoffset = results->ulr_offset;
|
|
slotsize = ulfs_rw16(ep->d_reclen,
|
|
needswap);
|
|
results->ulr_reclen = slotsize;
|
|
/*
|
|
* This is used to set
|
|
* results->ulr_endoff,
|
|
* which may be used by ulfs_direnter()
|
|
* as a length to truncate the
|
|
* directory to. Therefore, it must
|
|
* point past the end of the last
|
|
* non-empty directory entry. We don't
|
|
* know where that is in this case, so
|
|
* we effectively disable shrinking by
|
|
* using the existing size of the
|
|
* directory.
|
|
*
|
|
* Note that we wouldn't expect to
|
|
* shrink the directory while rewriting
|
|
* an existing entry anyway.
|
|
*/
|
|
enduseful = endsearch;
|
|
cnp->cn_flags |= ISWHITEOUT;
|
|
numdirpasses--;
|
|
goto notfound;
|
|
}
|
|
foundino = ulfs_rw32(ep->d_ino, needswap);
|
|
results->ulr_reclen =
|
|
ulfs_rw16(ep->d_reclen, needswap);
|
|
goto found;
|
|
}
|
|
}
|
|
prevoff = results->ulr_offset;
|
|
results->ulr_offset += ulfs_rw16(ep->d_reclen, needswap);
|
|
entryoffsetinblock += ulfs_rw16(ep->d_reclen, needswap);
|
|
if (ep->d_ino)
|
|
enduseful = results->ulr_offset;
|
|
}
|
|
notfound:
|
|
/*
|
|
* If we started in the middle of the directory and failed
|
|
* to find our target, we must check the beginning as well.
|
|
*/
|
|
if (numdirpasses == 2) {
|
|
numdirpasses--;
|
|
results->ulr_offset = 0;
|
|
endsearch = results->ulr_diroff;
|
|
goto searchloop;
|
|
}
|
|
if (bp != NULL)
|
|
brelse(bp, 0);
|
|
/*
|
|
* If creating, and at end of pathname and current
|
|
* directory has not been removed, then can consider
|
|
* allowing file to be created.
|
|
*/
|
|
if ((nameiop == CREATE || nameiop == RENAME ||
|
|
(nameiop == DELETE &&
|
|
(cnp->cn_flags & DOWHITEOUT) &&
|
|
(cnp->cn_flags & ISWHITEOUT))) &&
|
|
(flags & ISLASTCN) && dp->i_nlink != 0) {
|
|
/*
|
|
* Access for write is interpreted as allowing
|
|
* creation of files in the directory.
|
|
*/
|
|
error = VOP_ACCESS(vdp, VWRITE, cred);
|
|
if (error)
|
|
goto out;
|
|
/*
|
|
* Return an indication of where the new directory
|
|
* entry should be put. If we didn't find a slot,
|
|
* then set results->ulr_count to 0 indicating
|
|
* that the new slot belongs at the end of the
|
|
* directory. If we found a slot, then the new entry
|
|
* can be put in the range from results->ulr_offset to
|
|
* results->ulr_offset + results->ulr_count.
|
|
*/
|
|
if (slotstatus == NONE) {
|
|
results->ulr_offset = roundup(dp->i_size, dirblksiz);
|
|
results->ulr_count = 0;
|
|
enduseful = results->ulr_offset;
|
|
} else if (nameiop == DELETE) {
|
|
results->ulr_offset = slotoffset;
|
|
if ((results->ulr_offset & (dirblksiz - 1)) == 0)
|
|
results->ulr_count = 0;
|
|
else
|
|
results->ulr_count =
|
|
results->ulr_offset - prevoff;
|
|
} else {
|
|
results->ulr_offset = slotoffset;
|
|
results->ulr_count = slotsize;
|
|
if (enduseful < slotoffset + slotsize)
|
|
enduseful = slotoffset + slotsize;
|
|
}
|
|
results->ulr_endoff = roundup(enduseful, dirblksiz);
|
|
#if 0 /* commented out by dbj. none of the on disk fields changed */
|
|
dp->i_flag |= IN_CHANGE | IN_UPDATE;
|
|
#endif
|
|
/*
|
|
* We return with the directory locked, so that
|
|
* the parameters we set up above will still be
|
|
* valid if we actually decide to do a direnter().
|
|
* We return ni_vp == NULL to indicate that the entry
|
|
* does not currently exist; we leave a pointer to
|
|
* the (locked) directory inode in ndp->ni_dvp.
|
|
*
|
|
* NB - if the directory is unlocked, then this
|
|
* information cannot be used.
|
|
*/
|
|
error = EJUSTRETURN;
|
|
goto out;
|
|
}
|
|
/*
|
|
* Insert name into cache (as non-existent) if appropriate.
|
|
*/
|
|
if (nameiop != CREATE) {
|
|
cache_enter(vdp, *vpp, cnp->cn_nameptr, cnp->cn_namelen,
|
|
cnp->cn_flags);
|
|
}
|
|
error = ENOENT;
|
|
goto out;
|
|
|
|
found:
|
|
if (numdirpasses == 2)
|
|
nchstats.ncs_pass2++;
|
|
/*
|
|
* Check that directory length properly reflects presence
|
|
* of this entry.
|
|
*/
|
|
if (results->ulr_offset + LFS_DIRSIZ(FSFMT(vdp), ep, needswap) > dp->i_size) {
|
|
ulfs_dirbad(dp, results->ulr_offset, "i_size too small");
|
|
dp->i_size =
|
|
results->ulr_offset + LFS_DIRSIZ(FSFMT(vdp), ep, needswap);
|
|
DIP_ASSIGN(dp, size, dp->i_size);
|
|
dp->i_flag |= IN_CHANGE | IN_UPDATE;
|
|
}
|
|
brelse(bp, 0);
|
|
|
|
/*
|
|
* Found component in pathname.
|
|
* If the final component of path name, save information
|
|
* in the cache as to where the entry was found.
|
|
*/
|
|
if ((flags & ISLASTCN) && nameiop == LOOKUP)
|
|
results->ulr_diroff = results->ulr_offset &~ (dirblksiz - 1);
|
|
|
|
/*
|
|
* If deleting, and at end of pathname, return
|
|
* parameters which can be used to remove file.
|
|
* Lock the inode, being careful with ".".
|
|
*/
|
|
if (nameiop == DELETE && (flags & ISLASTCN)) {
|
|
/*
|
|
* Return pointer to current entry in results->ulr_offset,
|
|
* and distance past previous entry (if there
|
|
* is a previous entry in this block) in results->ulr_count.
|
|
* Save directory inode pointer in ndp->ni_dvp for dirremove().
|
|
*/
|
|
if ((results->ulr_offset & (dirblksiz - 1)) == 0)
|
|
results->ulr_count = 0;
|
|
else
|
|
results->ulr_count = results->ulr_offset - prevoff;
|
|
if (dp->i_number == foundino) {
|
|
vref(vdp);
|
|
tdp = vdp;
|
|
} else {
|
|
if (flags & ISDOTDOT)
|
|
VOP_UNLOCK(vdp); /* race to get the inode */
|
|
error = VFS_VGET(vdp->v_mount, foundino, &tdp);
|
|
if (flags & ISDOTDOT)
|
|
vn_lock(vdp, LK_EXCLUSIVE | LK_RETRY);
|
|
if (error)
|
|
goto out;
|
|
}
|
|
/*
|
|
* Write access to directory required to delete files.
|
|
*/
|
|
error = VOP_ACCESS(vdp, VWRITE, cred);
|
|
if (error) {
|
|
if (dp->i_number == foundino)
|
|
vrele(tdp);
|
|
else
|
|
vput(tdp);
|
|
goto out;
|
|
}
|
|
/*
|
|
* If directory is "sticky", then user must own
|
|
* the directory, or the file in it, else she
|
|
* may not delete it (unless she's root). This
|
|
* implements append-only directories.
|
|
*/
|
|
if (dp->i_mode & ISVTX) {
|
|
error = kauth_authorize_vnode(cred, KAUTH_VNODE_DELETE,
|
|
tdp, vdp, genfs_can_sticky(cred, dp->i_uid,
|
|
VTOI(tdp)->i_uid));
|
|
if (error) {
|
|
if (dp->i_number == foundino)
|
|
vrele(tdp);
|
|
else
|
|
vput(tdp);
|
|
error = EPERM;
|
|
goto out;
|
|
}
|
|
}
|
|
*vpp = tdp;
|
|
error = 0;
|
|
goto out;
|
|
}
|
|
|
|
/*
|
|
* If rewriting (RENAME), return the inode and the
|
|
* information required to rewrite the present directory
|
|
* Must get inode of directory entry to verify it's a
|
|
* regular file, or empty directory.
|
|
*/
|
|
if (nameiop == RENAME && (flags & ISLASTCN)) {
|
|
error = VOP_ACCESS(vdp, VWRITE, cred);
|
|
if (error)
|
|
goto out;
|
|
/*
|
|
* Careful about locking second inode.
|
|
* This can only occur if the target is ".".
|
|
*/
|
|
if (dp->i_number == foundino) {
|
|
error = EISDIR;
|
|
goto out;
|
|
}
|
|
if (flags & ISDOTDOT)
|
|
VOP_UNLOCK(vdp); /* race to get the inode */
|
|
error = VFS_VGET(vdp->v_mount, foundino, &tdp);
|
|
if (flags & ISDOTDOT)
|
|
vn_lock(vdp, LK_EXCLUSIVE | LK_RETRY);
|
|
if (error)
|
|
goto out;
|
|
*vpp = tdp;
|
|
error = 0;
|
|
goto out;
|
|
}
|
|
|
|
/*
|
|
* Step through the translation in the name. We do not `vput' the
|
|
* directory because we may need it again if a symbolic link
|
|
* is relative to the current directory. Instead we save it
|
|
* unlocked as "pdp". We must get the target inode before unlocking
|
|
* the directory to insure that the inode will not be removed
|
|
* before we get it. We prevent deadlock by always fetching
|
|
* inodes from the root, moving down the directory tree. Thus
|
|
* when following backward pointers ".." we must unlock the
|
|
* parent directory before getting the requested directory.
|
|
* There is a potential race condition here if both the current
|
|
* and parent directories are removed before the VFS_VGET for the
|
|
* inode associated with ".." returns. We hope that this occurs
|
|
* infrequently since we cannot avoid this race condition without
|
|
* implementing a sophisticated deadlock detection algorithm.
|
|
* Note also that this simple deadlock detection scheme will not
|
|
* work if the file system has any hard links other than ".."
|
|
* that point backwards in the directory structure.
|
|
*/
|
|
pdp = vdp;
|
|
if (flags & ISDOTDOT) {
|
|
VOP_UNLOCK(pdp); /* race to get the inode */
|
|
error = VFS_VGET(vdp->v_mount, foundino, &tdp);
|
|
vn_lock(pdp, LK_EXCLUSIVE | LK_RETRY);
|
|
if (error) {
|
|
goto out;
|
|
}
|
|
*vpp = tdp;
|
|
} else if (dp->i_number == foundino) {
|
|
vref(vdp); /* we want ourself, ie "." */
|
|
*vpp = vdp;
|
|
} else {
|
|
error = VFS_VGET(vdp->v_mount, foundino, &tdp);
|
|
if (error)
|
|
goto out;
|
|
*vpp = tdp;
|
|
}
|
|
|
|
/*
|
|
* Insert name into cache if appropriate.
|
|
*/
|
|
cache_enter(vdp, *vpp, cnp->cn_nameptr, cnp->cn_namelen, cnp->cn_flags);
|
|
error = 0;
|
|
|
|
out:
|
|
fstrans_done(vdp->v_mount);
|
|
return error;
|
|
}
|
|
|
|
void
|
|
ulfs_dirbad(struct inode *ip, doff_t offset, const char *how)
|
|
{
|
|
struct mount *mp;
|
|
|
|
mp = ITOV(ip)->v_mount;
|
|
printf("%s: bad dir ino %llu at offset %d: %s\n",
|
|
mp->mnt_stat.f_mntonname, (unsigned long long)ip->i_number,
|
|
offset, how);
|
|
if ((mp->mnt_stat.f_flag & MNT_RDONLY) == 0)
|
|
panic("bad dir");
|
|
}
|
|
|
|
/*
|
|
* Do consistency checking on a directory entry:
|
|
* record length must be multiple of 4
|
|
* entry must fit in rest of its DIRBLKSIZ block
|
|
* record must be large enough to contain entry
|
|
* name is not longer than LFS_MAXNAMLEN
|
|
* name must be as long as advertised, and null terminated
|
|
*/
|
|
int
|
|
ulfs_dirbadentry(struct vnode *dp, struct lfs_direct *ep, int entryoffsetinblock)
|
|
{
|
|
int i;
|
|
int namlen;
|
|
struct ulfsmount *ump = VFSTOULFS(dp->v_mount);
|
|
struct lfs *fs = ump->um_lfs;
|
|
const int needswap = ULFS_MPNEEDSWAP(fs);
|
|
int dirblksiz = fs->um_dirblksiz;
|
|
|
|
#if (BYTE_ORDER == LITTLE_ENDIAN)
|
|
if (FSFMT(dp) && needswap == 0)
|
|
namlen = ep->d_type;
|
|
else
|
|
namlen = ep->d_namlen;
|
|
#else
|
|
if (FSFMT(dp) && needswap != 0)
|
|
namlen = ep->d_type;
|
|
else
|
|
namlen = ep->d_namlen;
|
|
#endif
|
|
if ((ulfs_rw16(ep->d_reclen, needswap) & 0x3) != 0 ||
|
|
ulfs_rw16(ep->d_reclen, needswap) >
|
|
dirblksiz - (entryoffsetinblock & (dirblksiz - 1)) ||
|
|
ulfs_rw16(ep->d_reclen, needswap) <
|
|
LFS_DIRSIZ(FSFMT(dp), ep, needswap) ||
|
|
namlen > LFS_MAXNAMLEN) {
|
|
/*return (1); */
|
|
printf("First bad, reclen=%#x, DIRSIZ=%lu, namlen=%d, "
|
|
"flags=%#x, entryoffsetinblock=%d, dirblksiz = %d\n",
|
|
ulfs_rw16(ep->d_reclen, needswap),
|
|
(u_long)LFS_DIRSIZ(FSFMT(dp), ep, needswap),
|
|
namlen, dp->v_mount->mnt_flag, entryoffsetinblock,
|
|
dirblksiz);
|
|
goto bad;
|
|
}
|
|
if (ep->d_ino == 0)
|
|
return (0);
|
|
for (i = 0; i < namlen; i++)
|
|
if (ep->d_name[i] == '\0') {
|
|
/*return (1); */
|
|
printf("Second bad\n");
|
|
goto bad;
|
|
}
|
|
if (ep->d_name[i])
|
|
goto bad;
|
|
return (0);
|
|
bad:
|
|
return (1);
|
|
}
|
|
|
|
/*
|
|
* Construct a new directory entry after a call to namei, using the
|
|
* name in the componentname argument cnp. The argument ip is the
|
|
* inode to which the new directory entry will refer.
|
|
*/
|
|
void
|
|
ulfs_makedirentry(struct inode *ip, struct componentname *cnp,
|
|
struct lfs_direct *newdirp)
|
|
{
|
|
newdirp->d_ino = ip->i_number;
|
|
newdirp->d_namlen = cnp->cn_namelen;
|
|
memcpy(newdirp->d_name, cnp->cn_nameptr, (size_t)cnp->cn_namelen);
|
|
newdirp->d_name[cnp->cn_namelen] = '\0';
|
|
if (FSFMT(ITOV(ip)))
|
|
newdirp->d_type = 0;
|
|
else
|
|
newdirp->d_type = LFS_IFTODT(ip->i_mode);
|
|
}
|
|
|
|
/*
|
|
* Write a directory entry after a call to namei, using the parameters
|
|
* that ulfs_lookup left in nameidata and in the ulfs_lookup_results.
|
|
*
|
|
* DVP is the directory to be updated. It must be locked.
|
|
* ULR is the ulfs_lookup_results structure from the final lookup step.
|
|
* TVP is not used. (XXX: why is it here? remove it)
|
|
* DIRP is the new directory entry contents.
|
|
* CNP is the componentname from the final lookup step.
|
|
* NEWDIRBP is not used and (XXX) should be removed. The previous
|
|
* comment here said it was used by the now-removed softupdates code.
|
|
*
|
|
* The link count of the target inode is *not* incremented; the
|
|
* caller does that.
|
|
*
|
|
* If ulr->ulr_count is 0, ulfs_lookup did not find space to insert the
|
|
* directory entry. ulr_offset, which is the place to put the entry,
|
|
* should be on a block boundary (and should be at the end of the
|
|
* directory AFAIK) and a fresh block is allocated to put the new
|
|
* directory entry in.
|
|
*
|
|
* If ulr->ulr_count is not zero, ulfs_lookup found a slot to insert
|
|
* the entry into. This slot ranges from ulr_offset to ulr_offset +
|
|
* ulr_count. However, this slot may already be partially populated
|
|
* requiring compaction. See notes below.
|
|
*
|
|
* Furthermore, if ulr_count is not zero and ulr_endoff is not the
|
|
* same as i_size, the directory is truncated to size ulr_endoff.
|
|
*/
|
|
int
|
|
ulfs_direnter(struct vnode *dvp, const struct ulfs_lookup_results *ulr,
|
|
struct vnode *tvp, struct lfs_direct *dirp,
|
|
struct componentname *cnp, struct buf *newdirbp)
|
|
{
|
|
kauth_cred_t cr;
|
|
int newentrysize;
|
|
struct inode *dp;
|
|
struct buf *bp;
|
|
u_int dsize;
|
|
struct lfs_direct *ep, *nep;
|
|
int error, ret, lfs_blkoff, loc, spacefree;
|
|
char *dirbuf;
|
|
struct timespec ts;
|
|
struct ulfsmount *ump = VFSTOULFS(dvp->v_mount);
|
|
struct lfs *fs = ump->um_lfs;
|
|
const int needswap = ULFS_MPNEEDSWAP(fs);
|
|
int dirblksiz = fs->um_dirblksiz;
|
|
|
|
error = 0;
|
|
cr = cnp->cn_cred;
|
|
|
|
dp = VTOI(dvp);
|
|
newentrysize = LFS_DIRSIZ(0, dirp, 0);
|
|
|
|
if (ulr->ulr_count == 0) {
|
|
/*
|
|
* If ulr_count is 0, then namei could find no
|
|
* space in the directory. Here, ulr_offset will
|
|
* be on a directory block boundary and we will write the
|
|
* new entry into a fresh block.
|
|
*/
|
|
if (ulr->ulr_offset & (dirblksiz - 1))
|
|
panic("ulfs_direnter: newblk");
|
|
if ((error = lfs_balloc(dvp, (off_t)ulr->ulr_offset, dirblksiz,
|
|
cr, B_CLRBUF | B_SYNC, &bp)) != 0) {
|
|
return (error);
|
|
}
|
|
dp->i_size = ulr->ulr_offset + dirblksiz;
|
|
DIP_ASSIGN(dp, size, dp->i_size);
|
|
dp->i_flag |= IN_CHANGE | IN_UPDATE;
|
|
uvm_vnp_setsize(dvp, dp->i_size);
|
|
dirp->d_reclen = ulfs_rw16(dirblksiz, needswap);
|
|
dirp->d_ino = ulfs_rw32(dirp->d_ino, needswap);
|
|
if (FSFMT(dvp)) {
|
|
#if (BYTE_ORDER == LITTLE_ENDIAN)
|
|
if (needswap == 0) {
|
|
#else
|
|
if (needswap != 0) {
|
|
#endif
|
|
u_char tmp = dirp->d_namlen;
|
|
dirp->d_namlen = dirp->d_type;
|
|
dirp->d_type = tmp;
|
|
}
|
|
}
|
|
lfs_blkoff = ulr->ulr_offset & (ump->um_mountp->mnt_stat.f_iosize - 1);
|
|
memcpy((char *)bp->b_data + lfs_blkoff, dirp, newentrysize);
|
|
#ifdef LFS_DIRHASH
|
|
if (dp->i_dirhash != NULL) {
|
|
ulfsdirhash_newblk(dp, ulr->ulr_offset);
|
|
ulfsdirhash_add(dp, dirp, ulr->ulr_offset);
|
|
ulfsdirhash_checkblock(dp, (char *)bp->b_data + lfs_blkoff,
|
|
ulr->ulr_offset);
|
|
}
|
|
#endif
|
|
error = VOP_BWRITE(bp->b_vp, bp);
|
|
vfs_timestamp(&ts);
|
|
ret = lfs_update(dvp, &ts, &ts, UPDATE_DIROP);
|
|
if (error == 0)
|
|
return (ret);
|
|
return (error);
|
|
}
|
|
|
|
/*
|
|
* If ulr_count is non-zero, then namei found space for the new
|
|
* entry in the range ulr_offset to ulr_offset + ulr_count
|
|
* in the directory. To use this space, we may have to compact
|
|
* the entries located there, by copying them together towards the
|
|
* beginning of the block, leaving the free space in one usable
|
|
* chunk at the end.
|
|
*/
|
|
|
|
/*
|
|
* Increase size of directory if entry eats into new space.
|
|
* This should never push the size past a new multiple of
|
|
* DIRBLKSIZ.
|
|
*
|
|
* N.B. - THIS IS AN ARTIFACT OF 4.2 AND SHOULD NEVER HAPPEN.
|
|
*/
|
|
if (ulr->ulr_offset + ulr->ulr_count > dp->i_size) {
|
|
#ifdef DIAGNOSTIC
|
|
printf("ulfs_direnter: reached 4.2-only block, "
|
|
"not supposed to happen\n");
|
|
#endif
|
|
dp->i_size = ulr->ulr_offset + ulr->ulr_count;
|
|
DIP_ASSIGN(dp, size, dp->i_size);
|
|
dp->i_flag |= IN_CHANGE | IN_UPDATE;
|
|
}
|
|
/*
|
|
* Get the block containing the space for the new directory entry.
|
|
*/
|
|
error = ulfs_blkatoff(dvp, (off_t)ulr->ulr_offset, &dirbuf, &bp, true);
|
|
if (error) {
|
|
return (error);
|
|
}
|
|
/*
|
|
* Find space for the new entry. In the simple case, the entry at
|
|
* offset base will have the space. If it does not, then namei
|
|
* arranged that compacting the region ulr_offset to
|
|
* ulr_offset + ulr_count would yield the space.
|
|
*/
|
|
ep = (struct lfs_direct *)dirbuf;
|
|
dsize = (ep->d_ino != 0) ? LFS_DIRSIZ(FSFMT(dvp), ep, needswap) : 0;
|
|
spacefree = ulfs_rw16(ep->d_reclen, needswap) - dsize;
|
|
for (loc = ulfs_rw16(ep->d_reclen, needswap); loc < ulr->ulr_count; ) {
|
|
uint16_t reclen;
|
|
|
|
nep = (struct lfs_direct *)(dirbuf + loc);
|
|
|
|
/* Trim the existing slot (NB: dsize may be zero). */
|
|
ep->d_reclen = ulfs_rw16(dsize, needswap);
|
|
ep = (struct lfs_direct *)((char *)ep + dsize);
|
|
|
|
reclen = ulfs_rw16(nep->d_reclen, needswap);
|
|
loc += reclen;
|
|
if (nep->d_ino == 0) {
|
|
/*
|
|
* A mid-block unused entry. Such entries are
|
|
* never created by the kernel, but fsck_ffs
|
|
* can create them (and it doesn't fix them).
|
|
*
|
|
* Add up the free space, and initialise the
|
|
* relocated entry since we don't memcpy it.
|
|
*/
|
|
spacefree += reclen;
|
|
ep->d_ino = 0;
|
|
dsize = 0;
|
|
continue;
|
|
}
|
|
dsize = LFS_DIRSIZ(FSFMT(dvp), nep, needswap);
|
|
spacefree += reclen - dsize;
|
|
#ifdef LFS_DIRHASH
|
|
if (dp->i_dirhash != NULL)
|
|
ulfsdirhash_move(dp, nep,
|
|
ulr->ulr_offset + ((char *)nep - dirbuf),
|
|
ulr->ulr_offset + ((char *)ep - dirbuf));
|
|
#endif
|
|
memcpy((void *)ep, (void *)nep, dsize);
|
|
}
|
|
/*
|
|
* Here, `ep' points to a directory entry containing `dsize' in-use
|
|
* bytes followed by `spacefree' unused bytes. If ep->d_ino == 0,
|
|
* then the entry is completely unused (dsize == 0). The value
|
|
* of ep->d_reclen is always indeterminate.
|
|
*
|
|
* Update the pointer fields in the previous entry (if any),
|
|
* copy in the new entry, and write out the block.
|
|
*/
|
|
if (ep->d_ino == 0 ||
|
|
(ulfs_rw32(ep->d_ino, needswap) == ULFS_WINO &&
|
|
memcmp(ep->d_name, dirp->d_name, dirp->d_namlen) == 0)) {
|
|
if (spacefree + dsize < newentrysize)
|
|
panic("ulfs_direnter: compact1");
|
|
dirp->d_reclen = spacefree + dsize;
|
|
} else {
|
|
if (spacefree < newentrysize)
|
|
panic("ulfs_direnter: compact2");
|
|
dirp->d_reclen = spacefree;
|
|
ep->d_reclen = ulfs_rw16(dsize, needswap);
|
|
ep = (struct lfs_direct *)((char *)ep + dsize);
|
|
}
|
|
dirp->d_reclen = ulfs_rw16(dirp->d_reclen, needswap);
|
|
dirp->d_ino = ulfs_rw32(dirp->d_ino, needswap);
|
|
if (FSFMT(dvp)) {
|
|
#if (BYTE_ORDER == LITTLE_ENDIAN)
|
|
if (needswap == 0) {
|
|
#else
|
|
if (needswap != 0) {
|
|
#endif
|
|
u_char tmp = dirp->d_namlen;
|
|
dirp->d_namlen = dirp->d_type;
|
|
dirp->d_type = tmp;
|
|
}
|
|
}
|
|
#ifdef LFS_DIRHASH
|
|
if (dp->i_dirhash != NULL && (ep->d_ino == 0 ||
|
|
dirp->d_reclen == spacefree))
|
|
ulfsdirhash_add(dp, dirp, ulr->ulr_offset + ((char *)ep - dirbuf));
|
|
#endif
|
|
memcpy((void *)ep, (void *)dirp, (u_int)newentrysize);
|
|
#ifdef LFS_DIRHASH
|
|
if (dp->i_dirhash != NULL)
|
|
ulfsdirhash_checkblock(dp, dirbuf -
|
|
(ulr->ulr_offset & (dirblksiz - 1)),
|
|
ulr->ulr_offset & ~(dirblksiz - 1));
|
|
#endif
|
|
error = VOP_BWRITE(bp->b_vp, bp);
|
|
dp->i_flag |= IN_CHANGE | IN_UPDATE;
|
|
/*
|
|
* If all went well, and the directory can be shortened, proceed
|
|
* with the truncation. Note that we have to unlock the inode for
|
|
* the entry that we just entered, as the truncation may need to
|
|
* lock other inodes which can lead to deadlock if we also hold a
|
|
* lock on the newly entered node.
|
|
*/
|
|
if (error == 0 && ulr->ulr_endoff && ulr->ulr_endoff < dp->i_size) {
|
|
#ifdef LFS_DIRHASH
|
|
if (dp->i_dirhash != NULL)
|
|
ulfsdirhash_dirtrunc(dp, ulr->ulr_endoff);
|
|
#endif
|
|
(void) lfs_truncate(dvp, (off_t)ulr->ulr_endoff, IO_SYNC, cr);
|
|
}
|
|
return (error);
|
|
}
|
|
|
|
/*
|
|
* Remove a directory entry after a call to namei, using the
|
|
* parameters that ulfs_lookup left in nameidata and in the
|
|
* ulfs_lookup_results.
|
|
*
|
|
* DVP is the directory to be updated. It must be locked.
|
|
* ULR is the ulfs_lookup_results structure from the final lookup step.
|
|
* IP, if not null, is the inode being unlinked.
|
|
* FLAGS may contain DOWHITEOUT.
|
|
* ISRMDIR is not used and (XXX) should be removed.
|
|
*
|
|
* If FLAGS contains DOWHITEOUT the entry is replaced with a whiteout
|
|
* instead of being cleared.
|
|
*
|
|
* ulr->ulr_offset contains the position of the directory entry
|
|
* to be removed.
|
|
*
|
|
* ulr->ulr_reclen contains the size of the directory entry to be
|
|
* removed.
|
|
*
|
|
* ulr->ulr_count contains the size of the *previous* directory
|
|
* entry. This allows finding it, for free space management. If
|
|
* ulr_count is 0, the target entry is at the beginning of the
|
|
* directory. (Does this ever happen? The first entry should be ".",
|
|
* which should only be removed at rmdir time. Does rmdir come here
|
|
* to clear out the "." and ".." entries? Perhaps, but I doubt it.)
|
|
*
|
|
* The space is marked free by adding it to the record length (not
|
|
* name length) of the preceding entry. If the first entry becomes
|
|
* free, it is marked free by setting the inode number to 0.
|
|
*
|
|
* The link count of IP is decremented. Note that this is not the
|
|
* inverse behavior of ulfs_direnter, which does not adjust link
|
|
* counts. Sigh.
|
|
*/
|
|
int
|
|
ulfs_dirremove(struct vnode *dvp, const struct ulfs_lookup_results *ulr,
|
|
struct inode *ip, int flags, int isrmdir)
|
|
{
|
|
struct inode *dp = VTOI(dvp);
|
|
struct lfs_direct *ep;
|
|
struct buf *bp;
|
|
int error;
|
|
const int needswap = ULFS_MPNEEDSWAP(dp->i_lfs);
|
|
|
|
if (flags & DOWHITEOUT) {
|
|
/*
|
|
* Whiteout entry: set d_ino to ULFS_WINO.
|
|
*/
|
|
error = ulfs_blkatoff(dvp, (off_t)ulr->ulr_offset, (void *)&ep,
|
|
&bp, true);
|
|
if (error)
|
|
return (error);
|
|
ep->d_ino = ulfs_rw32(ULFS_WINO, needswap);
|
|
ep->d_type = LFS_DT_WHT;
|
|
goto out;
|
|
}
|
|
|
|
if ((error = ulfs_blkatoff(dvp,
|
|
(off_t)(ulr->ulr_offset - ulr->ulr_count), (void *)&ep, &bp, true)) != 0)
|
|
return (error);
|
|
|
|
#ifdef LFS_DIRHASH
|
|
/*
|
|
* Remove the dirhash entry. This is complicated by the fact
|
|
* that `ep' is the previous entry when ulr_count != 0.
|
|
*/
|
|
if (dp->i_dirhash != NULL)
|
|
ulfsdirhash_remove(dp, (ulr->ulr_count == 0) ? ep :
|
|
(struct lfs_direct *)((char *)ep +
|
|
ulfs_rw16(ep->d_reclen, needswap)), ulr->ulr_offset);
|
|
#endif
|
|
|
|
if (ulr->ulr_count == 0) {
|
|
/*
|
|
* First entry in block: set d_ino to zero.
|
|
*/
|
|
ep->d_ino = 0;
|
|
} else {
|
|
/*
|
|
* Collapse new free space into previous entry.
|
|
*/
|
|
ep->d_reclen =
|
|
ulfs_rw16(ulfs_rw16(ep->d_reclen, needswap) + ulr->ulr_reclen,
|
|
needswap);
|
|
}
|
|
|
|
#ifdef LFS_DIRHASH
|
|
if (dp->i_dirhash != NULL) {
|
|
int dirblksiz = ip->i_lfs->um_dirblksiz;
|
|
ulfsdirhash_checkblock(dp, (char *)ep -
|
|
((ulr->ulr_offset - ulr->ulr_count) & (dirblksiz - 1)),
|
|
ulr->ulr_offset & ~(dirblksiz - 1));
|
|
}
|
|
#endif
|
|
|
|
out:
|
|
if (ip) {
|
|
ip->i_nlink--;
|
|
DIP_ASSIGN(ip, nlink, ip->i_nlink);
|
|
ip->i_flag |= IN_CHANGE;
|
|
}
|
|
/*
|
|
* XXX did it ever occur to anyone that it might be a good
|
|
* idea to restore ip->i_nlink if this fails? Or something?
|
|
* Currently on error return from this function the state of
|
|
* ip->i_nlink depends on what happened, and callers
|
|
* definitely do not take this into account.
|
|
*/
|
|
error = VOP_BWRITE(bp->b_vp, bp);
|
|
dp->i_flag |= IN_CHANGE | IN_UPDATE;
|
|
/*
|
|
* If the last named reference to a snapshot goes away,
|
|
* drop its snapshot reference so that it will be reclaimed
|
|
* when last open reference goes away.
|
|
*/
|
|
if (ip != 0 && (ip->i_flags & SF_SNAPSHOT) != 0 &&
|
|
ip->i_nlink == 0)
|
|
ulfs_snapgone(ip);
|
|
return (error);
|
|
}
|
|
|
|
/*
|
|
* Rewrite an existing directory entry to point at the inode supplied.
|
|
*
|
|
* DP is the directory to update.
|
|
* OFFSET is the position of the entry in question. It may come
|
|
* from ulr_offset of a ulfs_lookup_results.
|
|
* OIP is the old inode the directory previously pointed to.
|
|
* NEWINUM is the number of the new inode.
|
|
* NEWTYPE is the new value for the type field of the directory entry.
|
|
* (This is ignored if the fs doesn't support that.)
|
|
* ISRMDIR is not used and (XXX) should be removed.
|
|
* IFLAGS are added to DP's inode flags.
|
|
*
|
|
* The link count of OIP is decremented. Note that the link count of
|
|
* the new inode is *not* incremented. Yay for symmetry.
|
|
*/
|
|
int
|
|
ulfs_dirrewrite(struct inode *dp, off_t offset,
|
|
struct inode *oip, ino_t newinum, int newtype,
|
|
int isrmdir, int iflags)
|
|
{
|
|
struct buf *bp;
|
|
struct lfs_direct *ep;
|
|
struct vnode *vdp = ITOV(dp);
|
|
int error;
|
|
|
|
error = ulfs_blkatoff(vdp, offset, (void *)&ep, &bp, true);
|
|
if (error)
|
|
return (error);
|
|
ep->d_ino = ulfs_rw32(newinum, ULFS_IPNEEDSWAP(dp));
|
|
if (!FSFMT(vdp))
|
|
ep->d_type = newtype;
|
|
oip->i_nlink--;
|
|
DIP_ASSIGN(oip, nlink, oip->i_nlink);
|
|
oip->i_flag |= IN_CHANGE;
|
|
error = VOP_BWRITE(bp->b_vp, bp);
|
|
dp->i_flag |= iflags;
|
|
/*
|
|
* If the last named reference to a snapshot goes away,
|
|
* drop its snapshot reference so that it will be reclaimed
|
|
* when last open reference goes away.
|
|
*/
|
|
if ((oip->i_flags & SF_SNAPSHOT) != 0 && oip->i_nlink == 0)
|
|
ulfs_snapgone(oip);
|
|
return (error);
|
|
}
|
|
|
|
/*
|
|
* Check if a directory is empty or not.
|
|
* Inode supplied must be locked.
|
|
*
|
|
* Using a struct lfs_dirtemplate here is not precisely
|
|
* what we want, but better than using a struct lfs_direct.
|
|
*
|
|
* NB: does not handle corrupted directories.
|
|
*/
|
|
int
|
|
ulfs_dirempty(struct inode *ip, ino_t parentino, kauth_cred_t cred)
|
|
{
|
|
doff_t off;
|
|
struct lfs_dirtemplate dbuf;
|
|
struct lfs_direct *dp = (struct lfs_direct *)&dbuf;
|
|
int error, namlen;
|
|
size_t count;
|
|
const int needswap = ULFS_IPNEEDSWAP(ip);
|
|
#define MINDIRSIZ (sizeof (struct lfs_dirtemplate) / 2)
|
|
|
|
for (off = 0; off < ip->i_size;
|
|
off += ulfs_rw16(dp->d_reclen, needswap)) {
|
|
error = vn_rdwr(UIO_READ, ITOV(ip), (void *)dp, MINDIRSIZ, off,
|
|
UIO_SYSSPACE, IO_NODELOCKED, cred, &count, NULL);
|
|
/*
|
|
* Since we read MINDIRSIZ, residual must
|
|
* be 0 unless we're at end of file.
|
|
*/
|
|
if (error || count != 0)
|
|
return (0);
|
|
/* avoid infinite loops */
|
|
if (dp->d_reclen == 0)
|
|
return (0);
|
|
/* skip empty entries */
|
|
if (dp->d_ino == 0 || ulfs_rw32(dp->d_ino, needswap) == ULFS_WINO)
|
|
continue;
|
|
/* accept only "." and ".." */
|
|
#if (BYTE_ORDER == LITTLE_ENDIAN)
|
|
if (FSFMT(ITOV(ip)) && needswap == 0)
|
|
namlen = dp->d_type;
|
|
else
|
|
namlen = dp->d_namlen;
|
|
#else
|
|
if (FSFMT(ITOV(ip)) && needswap != 0)
|
|
namlen = dp->d_type;
|
|
else
|
|
namlen = dp->d_namlen;
|
|
#endif
|
|
if (namlen > 2)
|
|
return (0);
|
|
if (dp->d_name[0] != '.')
|
|
return (0);
|
|
/*
|
|
* At this point namlen must be 1 or 2.
|
|
* 1 implies ".", 2 implies ".." if second
|
|
* char is also "."
|
|
*/
|
|
if (namlen == 1 &&
|
|
ulfs_rw32(dp->d_ino, needswap) == ip->i_number)
|
|
continue;
|
|
if (dp->d_name[1] == '.' &&
|
|
ulfs_rw32(dp->d_ino, needswap) == parentino)
|
|
continue;
|
|
return (0);
|
|
}
|
|
return (1);
|
|
}
|
|
|
|
/*
|
|
* Check if source directory is in the path of the target directory.
|
|
* Target is supplied locked, source is unlocked.
|
|
* The target is always vput before returning.
|
|
*/
|
|
int
|
|
ulfs_checkpath(struct inode *source, struct inode *target, kauth_cred_t cred)
|
|
{
|
|
struct vnode *nextvp, *vp;
|
|
int error, rootino, namlen;
|
|
struct lfs_dirtemplate dirbuf;
|
|
const int needswap = ULFS_IPNEEDSWAP(target);
|
|
|
|
vp = ITOV(target);
|
|
if (target->i_number == source->i_number) {
|
|
error = EEXIST;
|
|
goto out;
|
|
}
|
|
rootino = ULFS_ROOTINO;
|
|
error = 0;
|
|
if (target->i_number == rootino)
|
|
goto out;
|
|
|
|
for (;;) {
|
|
if (vp->v_type != VDIR) {
|
|
error = ENOTDIR;
|
|
break;
|
|
}
|
|
error = vn_rdwr(UIO_READ, vp, (void *)&dirbuf,
|
|
sizeof (struct lfs_dirtemplate), (off_t)0, UIO_SYSSPACE,
|
|
IO_NODELOCKED, cred, NULL, NULL);
|
|
if (error != 0)
|
|
break;
|
|
#if (BYTE_ORDER == LITTLE_ENDIAN)
|
|
if (FSFMT(vp) && needswap == 0)
|
|
namlen = dirbuf.dotdot_type;
|
|
else
|
|
namlen = dirbuf.dotdot_namlen;
|
|
#else
|
|
if (FSFMT(vp) && needswap != 0)
|
|
namlen = dirbuf.dotdot_type;
|
|
else
|
|
namlen = dirbuf.dotdot_namlen;
|
|
#endif
|
|
if (namlen != 2 ||
|
|
dirbuf.dotdot_name[0] != '.' ||
|
|
dirbuf.dotdot_name[1] != '.') {
|
|
error = ENOTDIR;
|
|
break;
|
|
}
|
|
if (ulfs_rw32(dirbuf.dotdot_ino, needswap) == source->i_number) {
|
|
error = EINVAL;
|
|
break;
|
|
}
|
|
if (ulfs_rw32(dirbuf.dotdot_ino, needswap) == rootino)
|
|
break;
|
|
VOP_UNLOCK(vp);
|
|
error = VFS_VGET(vp->v_mount,
|
|
ulfs_rw32(dirbuf.dotdot_ino, needswap), &nextvp);
|
|
vrele(vp);
|
|
if (error) {
|
|
vp = NULL;
|
|
break;
|
|
}
|
|
vp = nextvp;
|
|
}
|
|
|
|
out:
|
|
if (error == ENOTDIR)
|
|
printf("checkpath: .. not a directory\n");
|
|
if (vp != NULL)
|
|
vput(vp);
|
|
return (error);
|
|
}
|
|
|
|
/*
|
|
* Extract the inode number of ".." from a directory.
|
|
* Helper for ulfs_parentcheck.
|
|
*/
|
|
static int
|
|
ulfs_readdotdot(struct vnode *vp, int needswap, kauth_cred_t cred, ino_t *result)
|
|
{
|
|
struct lfs_dirtemplate dirbuf;
|
|
int namlen, error;
|
|
|
|
error = vn_rdwr(UIO_READ, vp, &dirbuf,
|
|
sizeof (struct lfs_dirtemplate), (off_t)0, UIO_SYSSPACE,
|
|
IO_NODELOCKED, cred, NULL, NULL);
|
|
if (error) {
|
|
return error;
|
|
}
|
|
|
|
#if (BYTE_ORDER == LITTLE_ENDIAN)
|
|
if (FSFMT(vp) && needswap == 0)
|
|
namlen = dirbuf.dotdot_type;
|
|
else
|
|
namlen = dirbuf.dotdot_namlen;
|
|
#else
|
|
if (FSFMT(vp) && needswap != 0)
|
|
namlen = dirbuf.dotdot_type;
|
|
else
|
|
namlen = dirbuf.dotdot_namlen;
|
|
#endif
|
|
if (namlen != 2 ||
|
|
dirbuf.dotdot_name[0] != '.' ||
|
|
dirbuf.dotdot_name[1] != '.') {
|
|
printf("ulfs_readdotdot: directory %llu contains "
|
|
"garbage instead of ..\n",
|
|
(unsigned long long) VTOI(vp)->i_number);
|
|
return ENOTDIR;
|
|
}
|
|
*result = ulfs_rw32(dirbuf.dotdot_ino, needswap);
|
|
return 0;
|
|
}
|
|
|
|
/*
|
|
* Check if LOWER is a descendent of UPPER. If we find UPPER, return
|
|
* nonzero in FOUND and return a reference to the immediate descendent
|
|
* of UPPER in UPPERCHILD. If we don't find UPPER (that is, if we
|
|
* reach the volume root and that isn't UPPER), return zero in FOUND
|
|
* and null in UPPERCHILD.
|
|
*
|
|
* Neither UPPER nor LOWER should be locked.
|
|
*
|
|
* On error (such as a permissions error checking up the directory
|
|
* tree) fail entirely.
|
|
*
|
|
* Note that UPPER and LOWER must be on the same volume, and because
|
|
* we inspect only that volume NEEDSWAP can be constant.
|
|
*/
|
|
int
|
|
ulfs_parentcheck(struct vnode *upper, struct vnode *lower, kauth_cred_t cred,
|
|
int *found_ret, struct vnode **upperchild_ret)
|
|
{
|
|
const int needswap = ULFS_IPNEEDSWAP(VTOI(lower));
|
|
ino_t upper_ino, found_ino;
|
|
struct vnode *current, *next;
|
|
int error;
|
|
|
|
if (upper == lower) {
|
|
vref(upper);
|
|
*found_ret = 1;
|
|
*upperchild_ret = upper;
|
|
return 0;
|
|
}
|
|
if (VTOI(lower)->i_number == ULFS_ROOTINO) {
|
|
*found_ret = 0;
|
|
*upperchild_ret = NULL;
|
|
return 0;
|
|
}
|
|
|
|
upper_ino = VTOI(upper)->i_number;
|
|
|
|
current = lower;
|
|
vref(current);
|
|
vn_lock(current, LK_EXCLUSIVE | LK_RETRY);
|
|
|
|
for (;;) {
|
|
error = ulfs_readdotdot(current, needswap, cred, &found_ino);
|
|
if (error) {
|
|
vput(current);
|
|
return error;
|
|
}
|
|
if (found_ino == upper_ino) {
|
|
VOP_UNLOCK(current);
|
|
*found_ret = 1;
|
|
*upperchild_ret = current;
|
|
return 0;
|
|
}
|
|
if (found_ino == ULFS_ROOTINO) {
|
|
vput(current);
|
|
*found_ret = 0;
|
|
*upperchild_ret = NULL;
|
|
return 0;
|
|
}
|
|
VOP_UNLOCK(current);
|
|
error = VFS_VGET(current->v_mount, found_ino, &next);
|
|
if (error) {
|
|
vrele(current);
|
|
return error;
|
|
}
|
|
KASSERT(VOP_ISLOCKED(next));
|
|
if (next->v_type != VDIR) {
|
|
printf("ulfs_parentcheck: inode %llu reached via .. of "
|
|
"inode %llu is not a directory\n",
|
|
(unsigned long long)VTOI(next)->i_number,
|
|
(unsigned long long)VTOI(current)->i_number);
|
|
vput(next);
|
|
vrele(current);
|
|
return ENOTDIR;
|
|
}
|
|
vrele(current);
|
|
current = next;
|
|
}
|
|
|
|
return 0;
|
|
}
|
|
|
|
#define ULFS_DIRRABLKS 0
|
|
int ulfs_dirrablks = ULFS_DIRRABLKS;
|
|
|
|
/*
|
|
* ulfs_blkatoff: Return buffer with the contents of block "offset" from
|
|
* the beginning of directory "vp". If "res" is non-NULL, fill it in with
|
|
* a pointer to the remaining space in the directory. If the caller intends
|
|
* to modify the buffer returned, "modify" must be true.
|
|
*/
|
|
|
|
int
|
|
ulfs_blkatoff(struct vnode *vp, off_t offset, char **res, struct buf **bpp,
|
|
bool modify)
|
|
{
|
|
struct inode *ip __diagused;
|
|
struct buf *bp;
|
|
daddr_t lbn;
|
|
const int dirrablks = ulfs_dirrablks;
|
|
daddr_t *blks;
|
|
int *blksizes;
|
|
int run, error;
|
|
struct mount *mp = vp->v_mount;
|
|
const int bshift = mp->mnt_fs_bshift;
|
|
const int bsize = 1 << bshift;
|
|
off_t eof;
|
|
|
|
blks = kmem_alloc((1 + dirrablks) * sizeof(daddr_t), KM_SLEEP);
|
|
blksizes = kmem_alloc((1 + dirrablks) * sizeof(int), KM_SLEEP);
|
|
ip = VTOI(vp);
|
|
KASSERT(vp->v_size == ip->i_size);
|
|
GOP_SIZE(vp, vp->v_size, &eof, 0);
|
|
lbn = offset >> bshift;
|
|
|
|
for (run = 0; run <= dirrablks;) {
|
|
const off_t curoff = lbn << bshift;
|
|
const int size = MIN(eof - curoff, bsize);
|
|
|
|
if (size == 0) {
|
|
break;
|
|
}
|
|
KASSERT(curoff < eof);
|
|
blks[run] = lbn;
|
|
blksizes[run] = size;
|
|
lbn++;
|
|
run++;
|
|
if (size != bsize) {
|
|
break;
|
|
}
|
|
}
|
|
KASSERT(run >= 1);
|
|
error = breadn(vp, blks[0], blksizes[0], &blks[1], &blksizes[1],
|
|
run - 1, NOCRED, (modify ? B_MODIFY : 0), &bp);
|
|
if (error != 0) {
|
|
*bpp = NULL;
|
|
goto out;
|
|
}
|
|
if (res) {
|
|
*res = (char *)bp->b_data + (offset & (bsize - 1));
|
|
}
|
|
*bpp = bp;
|
|
|
|
out:
|
|
kmem_free(blks, (1 + dirrablks) * sizeof(daddr_t));
|
|
kmem_free(blksizes, (1 + dirrablks) * sizeof(int));
|
|
return error;
|
|
}
|