Shared lookup makes it possible to create several negative cache
entries for one name. Then, creating inode with that name would remove one entry, leaving others dormant. Reclaiming the vnode would uncover negative entries, causing false return of ENOENT from the calls like stat, that do not create inode. Prevent creation of the duplicated negative entries. Reported and debugged with: pho Reviewed by: jhb X-MFC: after shared lookup changes
This commit is contained in:
parent
ffdaeffe21
commit
d6568724e1
@ -474,7 +474,7 @@ cache_enter(dvp, vp, cnp)
|
||||
struct vnode *vp;
|
||||
struct componentname *cnp;
|
||||
{
|
||||
struct namecache *ncp;
|
||||
struct namecache *ncp, *n2;
|
||||
struct nchashhead *ncpp;
|
||||
u_int32_t hash;
|
||||
int hold;
|
||||
@ -530,8 +530,6 @@ cache_enter(dvp, vp, cnp)
|
||||
* name.
|
||||
*/
|
||||
if (vp) {
|
||||
struct namecache *n2;
|
||||
|
||||
TAILQ_FOREACH(n2, &vp->v_cache_dst, nc_dst) {
|
||||
if (n2->nc_dvp == dvp &&
|
||||
n2->nc_nlen == cnp->cn_namelen &&
|
||||
@ -541,7 +539,16 @@ cache_enter(dvp, vp, cnp)
|
||||
return;
|
||||
}
|
||||
}
|
||||
}
|
||||
} else {
|
||||
TAILQ_FOREACH(n2, &ncneg, nc_dst) {
|
||||
if (n2->nc_nlen == cnp->cn_namelen &&
|
||||
!bcmp(n2->nc_name, cnp->cn_nameptr, n2->nc_nlen)) {
|
||||
CACHE_UNLOCK();
|
||||
cache_free(ncp);
|
||||
return;
|
||||
}
|
||||
}
|
||||
}
|
||||
|
||||
numcache++;
|
||||
if (!vp) {
|
||||
|
Loading…
x
Reference in New Issue
Block a user