static int remove_file(struct dentry *parent, char *name)
{
struct dentry *tmp;
int ret;
tmp = lookup_one_len(name, parent, strlen(name));
if (IS_ERR(tmp)) {
ret = PTR_ERR(tmp);
goto bail;
}
spin_lock(&tmp->d_lock);
if (!(d_unhashed(tmp) && tmp->d_inode)) {
dget_dlock(tmp);
__d_drop(tmp);
spin_unlock(&tmp->d_lock);
simple_unlink(parent->d_inode, tmp);
} else
spin_unlock(&tmp->d_lock);
ret = 0;
bail:
/*
* We don't expect clients to care about the return value, but
* it's there if they need it.
*/
return ret;
}
static int autofs4_dir_rmdir(struct inode *dir, struct dentry *dentry)
{
struct autofs_sb_info *sbi = autofs4_sbi(dir->i_sb);
struct autofs_info *ino = autofs4_dentry_ino(dentry);
lock_kernel();
if (!autofs4_oz_mode(sbi)) {
unlock_kernel();
return -EACCES;
}
spin_lock(&dcache_lock);
if (!list_empty(&dentry->d_subdirs)) {
spin_unlock(&dcache_lock);
unlock_kernel();
return -ENOTEMPTY;
}
__d_drop(dentry);
spin_unlock(&dcache_lock);
dput(ino->dentry);
dentry->d_inode->i_size = 0;
dentry->d_inode->i_nlink = 0;
if (dir->i_nlink)
dir->i_nlink--;
unlock_kernel();
return 0;
}
/* We do silly rename. In case sillyrename() returns -EBUSY, the inode
* belongs to an active ".nfs..." file and we return -EBUSY.
*
* If sillyrename() returns 0, we do nothing, otherwise we unlink.
*/
static int nfs_unlink(struct inode *dir, struct dentry *dentry)
{
int error;
int need_rehash = 0;
dfprintk(VFS, "NFS: unlink(%s/%ld, %s)\n", dir->i_sb->s_id,
dir->i_ino, dentry->d_name.name);
lock_kernel();
spin_lock(&dcache_lock);
spin_lock(&dentry->d_lock);
if (atomic_read(&dentry->d_count) > 1) {
spin_unlock(&dentry->d_lock);
spin_unlock(&dcache_lock);
error = nfs_sillyrename(dir, dentry);
unlock_kernel();
return error;
}
if (!d_unhashed(dentry)) {
__d_drop(dentry);
need_rehash = 1;
}
spin_unlock(&dentry->d_lock);
spin_unlock(&dcache_lock);
error = nfs_safe_remove(dentry);
if (!error) {
nfs_renew_times(dentry);
nfs_set_verifier(dentry, nfs_save_change_attribute(dir));
} else if (need_rehash)
d_rehash(dentry);
unlock_kernel();
return error;
}
/* Drop dentry if it is not used already, unhash otherwise.
Should be called with dcache lock held!
Returns: 1 if dentry was dropped, 0 if unhashed. */
int ll_drop_dentry(struct dentry *dentry)
{
lock_dentry(dentry);
if (atomic_read(&dentry->d_count) == 0) {
CDEBUG(D_DENTRY, "deleting dentry %.*s (%p) parent %p "
"inode %p\n", dentry->d_name.len,
dentry->d_name.name, dentry, dentry->d_parent,
dentry->d_inode);
dget_locked(dentry);
__d_drop(dentry);
unlock_dentry(dentry);
spin_unlock(&dcache_lock);
cfs_spin_unlock(&ll_lookup_lock);
dput(dentry);
cfs_spin_lock(&ll_lookup_lock);
spin_lock(&dcache_lock);
return 1;
}
/* disconected dentry can not be find without lookup, because we
* not need his to unhash or mark invalid. */
if (dentry->d_flags & DCACHE_DISCONNECTED) {
unlock_dentry(dentry);
RETURN (0);
}
if (!(dentry->d_flags & DCACHE_LUSTRE_INVALID)) {
CDEBUG(D_DENTRY, "unhashing dentry %.*s (%p) parent %p "
"inode %p refc %d\n", dentry->d_name.len,
dentry->d_name.name, dentry, dentry->d_parent,
dentry->d_inode, atomic_read(&dentry->d_count));
/* actually we don't unhash the dentry, rather just
* mark it inaccessible for to __d_lookup(). otherwise
* sys_getcwd() could return -ENOENT -bzzz */
dentry->d_flags |= DCACHE_LUSTRE_INVALID;
if (!dentry->d_inode || !S_ISDIR(dentry->d_inode->i_mode))
__d_drop(dentry);
}
unlock_dentry(dentry);
return 0;
}
static int remove_file(struct dentry *parent, char *name)
{
struct dentry *tmp;
int ret;
tmp = lookup_one_len(name, parent, strlen(name));
if (IS_ERR(tmp)) {
ret = PTR_ERR(tmp);
goto bail;
}
#if (LINUX_VERSION_CODE <= KERNEL_VERSION(2,6,36))
spin_lock(&dcache_lock);
#endif
spin_lock(&tmp->d_lock);
if (!(d_unhashed(tmp) && tmp->d_inode)) {
#if (LINUX_VERSION_CODE <= KERNEL_VERSION(2,6,36))
dget_locked(tmp);
#else
dget_dlock(tmp);
#endif
__d_drop(tmp);
spin_unlock(&tmp->d_lock);
#if (LINUX_VERSION_CODE <= KERNEL_VERSION(2,6,36))
spin_unlock(&dcache_lock);
#endif
simple_unlink(parent->d_inode, tmp);
} else {
spin_unlock(&tmp->d_lock);
#if (LINUX_VERSION_CODE <= KERNEL_VERSION(2,6,36))
spin_unlock(&dcache_lock);
#endif
}
ret = 0;
bail:
/*
* We don't expect clients to care about the return value, but
* it's there if they need it.
*/
return ret;
}
/**
* sysfs_drop_dentry - drop dentry for the specified sysfs_dirent
* @sd: target sysfs_dirent
*
* Drop dentry for @sd. @sd must have been unlinked from its
* parent on entry to this function such that it can't be looked
* up anymore.
*
* @sd->s_dentry which is protected with sysfs_assoc_lock points
* to the currently associated dentry but we're not holding a
* reference to it and racing with dput(). Grab dcache_lock and
* verify dentry before dropping it. If @sd->s_dentry is NULL or
* dput() beats us, no need to bother.
*/
static void sysfs_drop_dentry(struct sysfs_dirent *sd)
{
struct dentry *dentry = NULL;
struct inode *inode;
/* We're not holding a reference to ->s_dentry dentry but the
* field will stay valid as long as sysfs_assoc_lock is held.
*/
spin_lock(&sysfs_assoc_lock);
spin_lock(&dcache_lock);
/* drop dentry if it's there and dput() didn't kill it yet */
if (sd->s_dentry && sd->s_dentry->d_inode) {
dentry = dget_locked(sd->s_dentry);
spin_lock(&dentry->d_lock);
__d_drop(dentry);
spin_unlock(&dentry->d_lock);
}
spin_unlock(&dcache_lock);
spin_unlock(&sysfs_assoc_lock);
/* dentries for shadowed inodes are pinned, unpin */
if (dentry && sysfs_is_shadowed_inode(dentry->d_inode))
dput(dentry);
dput(dentry);
/* adjust nlink and update timestamp */
inode = ilookup(sysfs_sb, sd->s_ino);
if (inode) {
mutex_lock(&inode->i_mutex);
inode->i_ctime = CURRENT_TIME;
drop_nlink(inode);
if (sysfs_type(sd) == SYSFS_DIR)
drop_nlink(inode);
mutex_unlock(&inode->i_mutex);
iput(inode);
}
}
int ll_revalidate_it(struct dentry *de, int lookup_flags,
struct lookup_intent *it)
{
struct md_op_data *op_data;
struct ptlrpc_request *req = NULL;
struct lookup_intent lookup_it = { .it_op = IT_LOOKUP };
struct obd_export *exp;
struct inode *parent = de->d_parent->d_inode;
int rc, first = 0;
ENTRY;
CDEBUG(D_VFSTRACE, "VFS Op:name=%s,intent=%s\n", de->d_name.name,
LL_IT2STR(it));
if (de->d_inode == NULL) {
/* We can only use negative dentries if this is stat or lookup,
for opens and stuff we do need to query server. */
/* If there is IT_CREAT in intent op set, then we must throw
away this negative dentry and actually do the request to
kernel to create whatever needs to be created (if possible)*/
if (it && (it->it_op & IT_CREAT))
RETURN(0);
if (de->d_flags & DCACHE_LUSTRE_INVALID)
RETURN(0);
rc = ll_have_md_lock(parent, MDS_INODELOCK_UPDATE, LCK_MINMODE);
GOTO(out_sa, rc);
}
/* Never execute intents for mount points.
* Attributes will be fixed up in ll_inode_revalidate_it */
if (d_mountpoint(de))
GOTO(out_sa, rc = 1);
/* need to get attributes in case root got changed from other client */
if (de == de->d_sb->s_root) {
rc = __ll_inode_revalidate_it(de, it, MDS_INODELOCK_LOOKUP);
if (rc == 0)
rc = 1;
GOTO(out_sa, rc);
}
exp = ll_i2mdexp(de->d_inode);
OBD_FAIL_TIMEOUT(OBD_FAIL_MDC_REVALIDATE_PAUSE, 5);
ll_frob_intent(&it, &lookup_it);
LASSERT(it);
if (it->it_op == IT_LOOKUP && !(de->d_flags & DCACHE_LUSTRE_INVALID))
GOTO(out_sa, rc = 1);
op_data = ll_prep_md_op_data(NULL, parent, de->d_inode,
de->d_name.name, de->d_name.len,
0, LUSTRE_OPC_ANY, NULL);
if (IS_ERR(op_data))
RETURN(PTR_ERR(op_data));
if ((it->it_op == IT_OPEN) && de->d_inode) {
struct inode *inode = de->d_inode;
struct ll_inode_info *lli = ll_i2info(inode);
struct obd_client_handle **och_p;
__u64 *och_usecount;
/*
* We used to check for MDS_INODELOCK_OPEN here, but in fact
* just having LOOKUP lock is enough to justify inode is the
* same. And if inode is the same and we have suitable
* openhandle, then there is no point in doing another OPEN RPC
* just to throw away newly received openhandle. There are no
* security implications too, if file owner or access mode is
* change, LOOKUP lock is revoked.
*/
if (it->it_flags & FMODE_WRITE) {
och_p = &lli->lli_mds_write_och;
och_usecount = &lli->lli_open_fd_write_count;
} else if (it->it_flags & FMODE_EXEC) {
och_p = &lli->lli_mds_exec_och;
och_usecount = &lli->lli_open_fd_exec_count;
} else {
och_p = &lli->lli_mds_read_och;
och_usecount = &lli->lli_open_fd_read_count;
}
/* Check for the proper lock. */
if (!ll_have_md_lock(inode, MDS_INODELOCK_LOOKUP, LCK_MINMODE))
goto do_lock;
cfs_down(&lli->lli_och_sem);
if (*och_p) { /* Everything is open already, do nothing */
/*(*och_usecount)++; Do not let them steal our open
handle from under us */
/* XXX The code above was my original idea, but in case
we have the handle, but we cannot use it due to later
checks (e.g. O_CREAT|O_EXCL flags set), nobody
would decrement counter increased here. So we just
hope the lock won't be invalidated in between. But
if it would be, we'll reopen the open request to
MDS later during file open path */
cfs_up(&lli->lli_och_sem);
ll_finish_md_op_data(op_data);
RETURN(1);
} else {
cfs_up(&lli->lli_och_sem);
}
}
if (it->it_op == IT_GETATTR) {
first = ll_statahead_enter(parent, &de, 0);
if (first == 1) {
ll_statahead_exit(parent, de, 1);
ll_finish_md_op_data(op_data);
GOTO(out, rc = 1);
}
}
do_lock:
it->it_create_mode &= ~current->fs->umask;
it->it_create_mode |= M_CHECK_STALE;
rc = md_intent_lock(exp, op_data, NULL, 0, it,
lookup_flags,
&req, ll_md_blocking_ast, 0);
it->it_create_mode &= ~M_CHECK_STALE;
ll_finish_md_op_data(op_data);
if (it->it_op == IT_GETATTR && !first)
/* If there are too many locks on client-side, then some
* locks taken by statahead maybe dropped automatically
* before the real "revalidate" using them. */
ll_statahead_exit(parent, de, req == NULL ? rc : 0);
else if (first == -EEXIST)
ll_statahead_mark(parent, de);
/* If req is NULL, then md_intent_lock only tried to do a lock match;
* if all was well, it will return 1 if it found locks, 0 otherwise. */
if (req == NULL && rc >= 0) {
if (!rc)
goto do_lookup;
GOTO(out, rc);
}
if (rc < 0) {
if (rc != -ESTALE) {
CDEBUG(D_INFO, "ll_intent_lock: rc %d : it->it_status "
"%d\n", rc, it->d.lustre.it_status);
}
GOTO(out, rc = 0);
}
revalidate_finish:
rc = ll_revalidate_it_finish(req, it, de);
if (rc != 0) {
if (rc != -ESTALE && rc != -ENOENT)
ll_intent_release(it);
GOTO(out, rc = 0);
}
if ((it->it_op & IT_OPEN) && de->d_inode &&
!S_ISREG(de->d_inode->i_mode) &&
!S_ISDIR(de->d_inode->i_mode)) {
ll_release_openhandle(de, it);
}
rc = 1;
/* unfortunately ll_intent_lock may cause a callback and revoke our
* dentry */
cfs_spin_lock(&ll_lookup_lock);
spin_lock(&dcache_lock);
lock_dentry(de);
__d_drop(de);
unlock_dentry(de);
d_rehash_cond(de, 0);
spin_unlock(&dcache_lock);
cfs_spin_unlock(&ll_lookup_lock);
out:
/* We do not free request as it may be reused during following lookup
* (see comment in mdc/mdc_locks.c::mdc_intent_lock()), request will
* be freed in ll_lookup_it or in ll_intent_release. But if
* request was not completed, we need to free it. (bug 5154, 9903) */
if (req != NULL && !it_disposition(it, DISP_ENQ_COMPLETE))
ptlrpc_req_finished(req);
if (rc == 0) {
ll_unhash_aliases(de->d_inode);
/* done in ll_unhash_aliases()
dentry->d_flags |= DCACHE_LUSTRE_INVALID; */
} else {
CDEBUG(D_DENTRY, "revalidated dentry %.*s (%p) parent %p "
"inode %p refc %d\n", de->d_name.len,
de->d_name.name, de, de->d_parent, de->d_inode,
atomic_read(&de->d_count));
if (first != 1) {
if (de->d_flags & DCACHE_LUSTRE_INVALID) {
lock_dentry(de);
de->d_flags &= ~DCACHE_LUSTRE_INVALID;
unlock_dentry(de);
}
ll_lookup_finish_locks(it, de);
}
}
RETURN(rc);
/*
* This part is here to combat evil-evil race in real_lookup on 2.6
* kernels. The race details are: We enter do_lookup() looking for some
* name, there is nothing in dcache for this name yet and d_lookup()
* returns NULL. We proceed to real_lookup(), and while we do this,
* another process does open on the same file we looking up (most simple
* reproducer), open succeeds and the dentry is added. Now back to
* us. In real_lookup() we do d_lookup() again and suddenly find the
* dentry, so we call d_revalidate on it, but there is no lock, so
* without this code we would return 0, but unpatched real_lookup just
* returns -ENOENT in such a case instead of retrying the lookup. Once
* this is dealt with in real_lookup(), all of this ugly mess can go and
* we can just check locks in ->d_revalidate without doing any RPCs
* ever.
*/
do_lookup:
if (it != &lookup_it) {
/* MDS_INODELOCK_UPDATE needed for IT_GETATTR case. */
if (it->it_op == IT_GETATTR)
lookup_it.it_op = IT_GETATTR;
ll_lookup_finish_locks(it, de);
it = &lookup_it;
}
/* Do real lookup here. */
op_data = ll_prep_md_op_data(NULL, parent, NULL, de->d_name.name,
de->d_name.len, 0, (it->it_op & IT_CREAT ?
LUSTRE_OPC_CREATE :
LUSTRE_OPC_ANY), NULL);
if (IS_ERR(op_data))
RETURN(PTR_ERR(op_data));
rc = md_intent_lock(exp, op_data, NULL, 0, it, 0, &req,
ll_md_blocking_ast, 0);
if (rc >= 0) {
struct mdt_body *mdt_body;
struct lu_fid fid = {.f_seq = 0, .f_oid = 0, .f_ver = 0};
mdt_body = req_capsule_server_get(&req->rq_pill, &RMF_MDT_BODY);
if (de->d_inode)
fid = *ll_inode2fid(de->d_inode);
/* see if we got same inode, if not - return error */
if (lu_fid_eq(&fid, &mdt_body->fid1)) {
ll_finish_md_op_data(op_data);
op_data = NULL;
goto revalidate_finish;
}
ll_intent_release(it);
}
ll_finish_md_op_data(op_data);
GOTO(out, rc = 0);
out_sa:
/*
* For rc == 1 case, should not return directly to prevent losing
* statahead windows; for rc == 0 case, the "lookup" will be done later.
*/
if (it && it->it_op == IT_GETATTR && rc == 1) {
first = ll_statahead_enter(parent, &de, 0);
if (first >= 0)
ll_statahead_exit(parent, de, 1);
else if (first == -EEXIST)
ll_statahead_mark(parent, de);
}
return rc;
}
#if 0
static void ll_pin(struct dentry *de, struct vfsmount *mnt, int flag)
{
struct inode *inode= de->d_inode;
struct ll_sb_info *sbi = ll_i2sbi(inode);
struct ll_dentry_data *ldd = ll_d2d(de);
struct obd_client_handle *handle;
struct obd_capa *oc;
int rc = 0;
ENTRY;
LASSERT(ldd);
cfs_lock_kernel();
/* Strictly speaking this introduces an additional race: the
* increments should wait until the rpc has returned.
* However, given that at present the function is void, this
* issue is moot. */
if (flag == 1 && (++ldd->lld_mnt_count) > 1) {
cfs_unlock_kernel();
EXIT;
return;
}
if (flag == 0 && (++ldd->lld_cwd_count) > 1) {
cfs_unlock_kernel();
EXIT;
return;
}
cfs_unlock_kernel();
handle = (flag) ? &ldd->lld_mnt_och : &ldd->lld_cwd_och;
oc = ll_mdscapa_get(inode);
rc = obd_pin(sbi->ll_md_exp, ll_inode2fid(inode), oc, handle, flag);
capa_put(oc);
if (rc) {
cfs_lock_kernel();
memset(handle, 0, sizeof(*handle));
if (flag == 0)
ldd->lld_cwd_count--;
else
ldd->lld_mnt_count--;
cfs_unlock_kernel();
}
EXIT;
return;
}
static void ll_unpin(struct dentry *de, struct vfsmount *mnt, int flag)
{
struct ll_sb_info *sbi = ll_i2sbi(de->d_inode);
struct ll_dentry_data *ldd = ll_d2d(de);
struct obd_client_handle handle;
int count, rc = 0;
ENTRY;
LASSERT(ldd);
cfs_lock_kernel();
/* Strictly speaking this introduces an additional race: the
* increments should wait until the rpc has returned.
* However, given that at present the function is void, this
* issue is moot. */
handle = (flag) ? ldd->lld_mnt_och : ldd->lld_cwd_och;
if (handle.och_magic != OBD_CLIENT_HANDLE_MAGIC) {
/* the "pin" failed */
cfs_unlock_kernel();
EXIT;
return;
}
if (flag)
count = --ldd->lld_mnt_count;
else
count = --ldd->lld_cwd_count;
cfs_unlock_kernel();
if (count != 0) {
EXIT;
return;
}
rc = obd_unpin(sbi->ll_md_exp, &handle, flag);
EXIT;
return;
}
#endif
#ifdef HAVE_VFS_INTENT_PATCHES
int ll_revalidate_nd(struct dentry *dentry, struct nameidata *nd)
{
int rc;
ENTRY;
if (nd && nd->flags & LOOKUP_LAST && !(nd->flags & LOOKUP_LINK_NOTLAST))
rc = ll_revalidate_it(dentry, nd->flags, &nd->intent);
else
rc = ll_revalidate_it(dentry, 0, NULL);
RETURN(rc);
}
/*
* returns: -ERRNO if error (returned to user)
* 0: tell VFS to invalidate dentry
* 1: dentry is valid
*/
static int esdfs_d_revalidate(struct dentry *dentry, struct nameidata *nd)
{
struct path lower_path;
struct path lower_parent_path;
struct dentry *parent_dentry = NULL;
struct dentry *lower_dentry = NULL;
struct dentry *lower_parent_dentry = NULL;
int err = 1;
if (nd && (nd->flags & LOOKUP_RCU))
return -ECHILD;
/* short-circuit if it's root */
spin_lock(&dentry->d_lock);
if (IS_ROOT(dentry)) {
spin_unlock(&dentry->d_lock);
return 1;
}
spin_unlock(&dentry->d_lock);
esdfs_get_lower_path(dentry, &lower_path);
lower_dentry = lower_path.dentry;
esdfs_get_lower_parent(dentry, lower_dentry, &lower_parent_dentry);
parent_dentry = dget_parent(dentry);
esdfs_get_lower_path(parent_dentry, &lower_parent_path);
if (lower_parent_path.dentry != lower_parent_dentry)
goto drop;
/* can't do strcmp if lower is hashed */
spin_lock(&lower_dentry->d_lock);
if (d_unhashed(lower_dentry)) {
spin_unlock(&lower_dentry->d_lock);
goto drop;
}
spin_lock(&dentry->d_lock);
if (lower_dentry->d_name.len != dentry->d_name.len ||
strncasecmp(lower_dentry->d_name.name,
dentry->d_name.name,
dentry->d_name.len) != 0) {
err = 0;
__d_drop(dentry); /* already holding spin lock */
}
spin_unlock(&dentry->d_lock);
spin_unlock(&lower_dentry->d_lock);
esdfs_revalidate_perms(dentry);
goto out;
drop:
d_drop(dentry);
err = 0;
out:
esdfs_put_lower_path(parent_dentry, &lower_parent_path);
dput(parent_dentry);
esdfs_put_lower_parent(dentry, &lower_parent_dentry);
esdfs_put_lower_path(dentry, &lower_path);
return err;
}
/*
* returns: -ERRNO if error (returned to user)
* 0: tell VFS to invalidate dentry
* 1: dentry is valid
*/
static int sdcardfskk_d_revalidate(struct dentry *dentry, struct nameidata *nd)
{
int err = 1;
struct path parent_lower_path, lower_path;
struct dentry *parent_dentry = NULL;
struct dentry *parent_lower_dentry = NULL;
struct dentry *lower_cur_parent_dentry = NULL;
struct dentry *lower_dentry = NULL;
if (nd && nd->flags & LOOKUP_RCU)
return -ECHILD;
spin_lock(&dentry->d_lock);
if (IS_ROOT(dentry)) {
spin_unlock(&dentry->d_lock);
return 1;
}
spin_unlock(&dentry->d_lock);
/* check uninitialized obb_dentry and
* whether the base obbpath has been changed or not */
if (is_obbpath_invalid(dentry)) {
d_drop(dentry);
return 0;
}
parent_dentry = dget_parent(dentry);
sdcardfskk_get_lower_path(parent_dentry, &parent_lower_path);
sdcardfskk_get_real_lower(dentry, &lower_path);
parent_lower_dentry = parent_lower_path.dentry;
lower_dentry = lower_path.dentry;
lower_cur_parent_dentry = dget_parent(lower_dentry);
spin_lock(&lower_dentry->d_lock);
if (d_unhashed(lower_dentry)) {
spin_unlock(&lower_dentry->d_lock);
d_drop(dentry);
err = 0;
goto out;
}
spin_unlock(&lower_dentry->d_lock);
if (parent_lower_dentry != lower_cur_parent_dentry) {
d_drop(dentry);
err = 0;
goto out;
}
if (dentry < lower_dentry) {
spin_lock(&dentry->d_lock);
spin_lock(&lower_dentry->d_lock);
} else {
spin_lock(&lower_dentry->d_lock);
spin_lock(&dentry->d_lock);
}
if (dentry->d_name.len != lower_dentry->d_name.len) {
__d_drop(dentry);
err = 0;
} else if (strncasecmp(dentry->d_name.name, lower_dentry->d_name.name,
dentry->d_name.len) != 0) {
__d_drop(dentry);
err = 0;
}
if (dentry < lower_dentry) {
spin_unlock(&lower_dentry->d_lock);
spin_unlock(&dentry->d_lock);
} else {
spin_unlock(&dentry->d_lock);
spin_unlock(&lower_dentry->d_lock);
}
out:
dput(parent_dentry);
dput(lower_cur_parent_dentry);
sdcardfskk_put_lower_path(parent_dentry, &parent_lower_path);
sdcardfskk_put_real_lower(dentry, &lower_path);
return err;
}
