mirror of
https://github.com/Fishwaldo/Star64_linux.git
synced 2025-06-24 07:31:41 +00:00
Merge branch 'work.namei' into for-linus
This commit is contained in:
commit
f6c99aad4d
1 changed files with 95 additions and 88 deletions
183
fs/namei.c
183
fs/namei.c
|
@ -672,52 +672,83 @@ static bool legitimize_links(struct nameidata *nd)
|
||||||
/**
|
/**
|
||||||
* unlazy_walk - try to switch to ref-walk mode.
|
* unlazy_walk - try to switch to ref-walk mode.
|
||||||
* @nd: nameidata pathwalk data
|
* @nd: nameidata pathwalk data
|
||||||
* @dentry: child of nd->path.dentry or NULL
|
|
||||||
* @seq: seq number to check dentry against
|
|
||||||
* Returns: 0 on success, -ECHILD on failure
|
* Returns: 0 on success, -ECHILD on failure
|
||||||
*
|
*
|
||||||
* unlazy_walk attempts to legitimize the current nd->path, nd->root and dentry
|
* unlazy_walk attempts to legitimize the current nd->path and nd->root
|
||||||
* for ref-walk mode. @dentry must be a path found by a do_lookup call on
|
* for ref-walk mode.
|
||||||
* @nd or NULL. Must be called from rcu-walk context.
|
* Must be called from rcu-walk context.
|
||||||
* Nothing should touch nameidata between unlazy_walk() failure and
|
* Nothing should touch nameidata between unlazy_walk() failure and
|
||||||
* terminate_walk().
|
* terminate_walk().
|
||||||
*/
|
*/
|
||||||
static int unlazy_walk(struct nameidata *nd, struct dentry *dentry, unsigned seq)
|
static int unlazy_walk(struct nameidata *nd)
|
||||||
{
|
{
|
||||||
struct dentry *parent = nd->path.dentry;
|
struct dentry *parent = nd->path.dentry;
|
||||||
|
|
||||||
BUG_ON(!(nd->flags & LOOKUP_RCU));
|
BUG_ON(!(nd->flags & LOOKUP_RCU));
|
||||||
|
|
||||||
|
nd->flags &= ~LOOKUP_RCU;
|
||||||
|
if (unlikely(!legitimize_links(nd)))
|
||||||
|
goto out2;
|
||||||
|
if (unlikely(!legitimize_path(nd, &nd->path, nd->seq)))
|
||||||
|
goto out1;
|
||||||
|
if (nd->root.mnt && !(nd->flags & LOOKUP_ROOT)) {
|
||||||
|
if (unlikely(!legitimize_path(nd, &nd->root, nd->root_seq)))
|
||||||
|
goto out;
|
||||||
|
}
|
||||||
|
rcu_read_unlock();
|
||||||
|
BUG_ON(nd->inode != parent->d_inode);
|
||||||
|
return 0;
|
||||||
|
|
||||||
|
out2:
|
||||||
|
nd->path.mnt = NULL;
|
||||||
|
nd->path.dentry = NULL;
|
||||||
|
out1:
|
||||||
|
if (!(nd->flags & LOOKUP_ROOT))
|
||||||
|
nd->root.mnt = NULL;
|
||||||
|
out:
|
||||||
|
rcu_read_unlock();
|
||||||
|
return -ECHILD;
|
||||||
|
}
|
||||||
|
|
||||||
|
/**
|
||||||
|
* unlazy_child - try to switch to ref-walk mode.
|
||||||
|
* @nd: nameidata pathwalk data
|
||||||
|
* @dentry: child of nd->path.dentry
|
||||||
|
* @seq: seq number to check dentry against
|
||||||
|
* Returns: 0 on success, -ECHILD on failure
|
||||||
|
*
|
||||||
|
* unlazy_child attempts to legitimize the current nd->path, nd->root and dentry
|
||||||
|
* for ref-walk mode. @dentry must be a path found by a do_lookup call on
|
||||||
|
* @nd. Must be called from rcu-walk context.
|
||||||
|
* Nothing should touch nameidata between unlazy_child() failure and
|
||||||
|
* terminate_walk().
|
||||||
|
*/
|
||||||
|
static int unlazy_child(struct nameidata *nd, struct dentry *dentry, unsigned seq)
|
||||||
|
{
|
||||||
|
BUG_ON(!(nd->flags & LOOKUP_RCU));
|
||||||
|
|
||||||
nd->flags &= ~LOOKUP_RCU;
|
nd->flags &= ~LOOKUP_RCU;
|
||||||
if (unlikely(!legitimize_links(nd)))
|
if (unlikely(!legitimize_links(nd)))
|
||||||
goto out2;
|
goto out2;
|
||||||
if (unlikely(!legitimize_mnt(nd->path.mnt, nd->m_seq)))
|
if (unlikely(!legitimize_mnt(nd->path.mnt, nd->m_seq)))
|
||||||
goto out2;
|
goto out2;
|
||||||
if (unlikely(!lockref_get_not_dead(&parent->d_lockref)))
|
if (unlikely(!lockref_get_not_dead(&nd->path.dentry->d_lockref)))
|
||||||
goto out1;
|
goto out1;
|
||||||
|
|
||||||
/*
|
/*
|
||||||
* For a negative lookup, the lookup sequence point is the parents
|
* We need to move both the parent and the dentry from the RCU domain
|
||||||
* sequence point, and it only needs to revalidate the parent dentry.
|
* to be properly refcounted. And the sequence number in the dentry
|
||||||
*
|
* validates *both* dentry counters, since we checked the sequence
|
||||||
* For a positive lookup, we need to move both the parent and the
|
* number of the parent after we got the child sequence number. So we
|
||||||
* dentry from the RCU domain to be properly refcounted. And the
|
* know the parent must still be valid if the child sequence number is
|
||||||
* sequence number in the dentry validates *both* dentry counters,
|
|
||||||
* since we checked the sequence number of the parent after we got
|
|
||||||
* the child sequence number. So we know the parent must still
|
|
||||||
* be valid if the child sequence number is still valid.
|
|
||||||
*/
|
*/
|
||||||
if (!dentry) {
|
if (unlikely(!lockref_get_not_dead(&dentry->d_lockref)))
|
||||||
if (read_seqcount_retry(&parent->d_seq, nd->seq))
|
goto out;
|
||||||
goto out;
|
if (unlikely(read_seqcount_retry(&dentry->d_seq, seq))) {
|
||||||
BUG_ON(nd->inode != parent->d_inode);
|
rcu_read_unlock();
|
||||||
} else {
|
dput(dentry);
|
||||||
if (!lockref_get_not_dead(&dentry->d_lockref))
|
goto drop_root_mnt;
|
||||||
goto out;
|
|
||||||
if (read_seqcount_retry(&dentry->d_seq, seq))
|
|
||||||
goto drop_dentry;
|
|
||||||
}
|
}
|
||||||
|
|
||||||
/*
|
/*
|
||||||
* Sequence counts matched. Now make sure that the root is
|
* Sequence counts matched. Now make sure that the root is
|
||||||
* still valid and get it if required.
|
* still valid and get it if required.
|
||||||
|
@ -733,10 +764,6 @@ static int unlazy_walk(struct nameidata *nd, struct dentry *dentry, unsigned seq
|
||||||
rcu_read_unlock();
|
rcu_read_unlock();
|
||||||
return 0;
|
return 0;
|
||||||
|
|
||||||
drop_dentry:
|
|
||||||
rcu_read_unlock();
|
|
||||||
dput(dentry);
|
|
||||||
goto drop_root_mnt;
|
|
||||||
out2:
|
out2:
|
||||||
nd->path.mnt = NULL;
|
nd->path.mnt = NULL;
|
||||||
out1:
|
out1:
|
||||||
|
@ -749,27 +776,12 @@ drop_root_mnt:
|
||||||
return -ECHILD;
|
return -ECHILD;
|
||||||
}
|
}
|
||||||
|
|
||||||
static int unlazy_link(struct nameidata *nd, struct path *link, unsigned seq)
|
|
||||||
{
|
|
||||||
if (unlikely(!legitimize_path(nd, link, seq))) {
|
|
||||||
drop_links(nd);
|
|
||||||
nd->depth = 0;
|
|
||||||
nd->flags &= ~LOOKUP_RCU;
|
|
||||||
nd->path.mnt = NULL;
|
|
||||||
nd->path.dentry = NULL;
|
|
||||||
if (!(nd->flags & LOOKUP_ROOT))
|
|
||||||
nd->root.mnt = NULL;
|
|
||||||
rcu_read_unlock();
|
|
||||||
} else if (likely(unlazy_walk(nd, NULL, 0)) == 0) {
|
|
||||||
return 0;
|
|
||||||
}
|
|
||||||
path_put(link);
|
|
||||||
return -ECHILD;
|
|
||||||
}
|
|
||||||
|
|
||||||
static inline int d_revalidate(struct dentry *dentry, unsigned int flags)
|
static inline int d_revalidate(struct dentry *dentry, unsigned int flags)
|
||||||
{
|
{
|
||||||
return dentry->d_op->d_revalidate(dentry, flags);
|
if (unlikely(dentry->d_flags & DCACHE_OP_REVALIDATE))
|
||||||
|
return dentry->d_op->d_revalidate(dentry, flags);
|
||||||
|
else
|
||||||
|
return 1;
|
||||||
}
|
}
|
||||||
|
|
||||||
/**
|
/**
|
||||||
|
@ -790,7 +802,7 @@ static int complete_walk(struct nameidata *nd)
|
||||||
if (nd->flags & LOOKUP_RCU) {
|
if (nd->flags & LOOKUP_RCU) {
|
||||||
if (!(nd->flags & LOOKUP_ROOT))
|
if (!(nd->flags & LOOKUP_ROOT))
|
||||||
nd->root.mnt = NULL;
|
nd->root.mnt = NULL;
|
||||||
if (unlikely(unlazy_walk(nd, NULL, 0)))
|
if (unlikely(unlazy_walk(nd)))
|
||||||
return -ECHILD;
|
return -ECHILD;
|
||||||
}
|
}
|
||||||
|
|
||||||
|
@ -1016,7 +1028,7 @@ const char *get_link(struct nameidata *nd)
|
||||||
touch_atime(&last->link);
|
touch_atime(&last->link);
|
||||||
cond_resched();
|
cond_resched();
|
||||||
} else if (atime_needs_update_rcu(&last->link, inode)) {
|
} else if (atime_needs_update_rcu(&last->link, inode)) {
|
||||||
if (unlikely(unlazy_walk(nd, NULL, 0)))
|
if (unlikely(unlazy_walk(nd)))
|
||||||
return ERR_PTR(-ECHILD);
|
return ERR_PTR(-ECHILD);
|
||||||
touch_atime(&last->link);
|
touch_atime(&last->link);
|
||||||
}
|
}
|
||||||
|
@ -1035,7 +1047,7 @@ const char *get_link(struct nameidata *nd)
|
||||||
if (nd->flags & LOOKUP_RCU) {
|
if (nd->flags & LOOKUP_RCU) {
|
||||||
res = get(NULL, inode, &last->done);
|
res = get(NULL, inode, &last->done);
|
||||||
if (res == ERR_PTR(-ECHILD)) {
|
if (res == ERR_PTR(-ECHILD)) {
|
||||||
if (unlikely(unlazy_walk(nd, NULL, 0)))
|
if (unlikely(unlazy_walk(nd)))
|
||||||
return ERR_PTR(-ECHILD);
|
return ERR_PTR(-ECHILD);
|
||||||
res = get(dentry, inode, &last->done);
|
res = get(dentry, inode, &last->done);
|
||||||
}
|
}
|
||||||
|
@ -1469,19 +1481,14 @@ static struct dentry *lookup_dcache(const struct qstr *name,
|
||||||
struct dentry *dir,
|
struct dentry *dir,
|
||||||
unsigned int flags)
|
unsigned int flags)
|
||||||
{
|
{
|
||||||
struct dentry *dentry;
|
struct dentry *dentry = d_lookup(dir, name);
|
||||||
int error;
|
|
||||||
|
|
||||||
dentry = d_lookup(dir, name);
|
|
||||||
if (dentry) {
|
if (dentry) {
|
||||||
if (dentry->d_flags & DCACHE_OP_REVALIDATE) {
|
int error = d_revalidate(dentry, flags);
|
||||||
error = d_revalidate(dentry, flags);
|
if (unlikely(error <= 0)) {
|
||||||
if (unlikely(error <= 0)) {
|
if (!error)
|
||||||
if (!error)
|
d_invalidate(dentry);
|
||||||
d_invalidate(dentry);
|
dput(dentry);
|
||||||
dput(dentry);
|
return ERR_PTR(error);
|
||||||
return ERR_PTR(error);
|
|
||||||
}
|
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
return dentry;
|
return dentry;
|
||||||
|
@ -1546,7 +1553,7 @@ static int lookup_fast(struct nameidata *nd,
|
||||||
bool negative;
|
bool negative;
|
||||||
dentry = __d_lookup_rcu(parent, &nd->last, &seq);
|
dentry = __d_lookup_rcu(parent, &nd->last, &seq);
|
||||||
if (unlikely(!dentry)) {
|
if (unlikely(!dentry)) {
|
||||||
if (unlazy_walk(nd, NULL, 0))
|
if (unlazy_walk(nd))
|
||||||
return -ECHILD;
|
return -ECHILD;
|
||||||
return 0;
|
return 0;
|
||||||
}
|
}
|
||||||
|
@ -1571,14 +1578,8 @@ static int lookup_fast(struct nameidata *nd,
|
||||||
return -ECHILD;
|
return -ECHILD;
|
||||||
|
|
||||||
*seqp = seq;
|
*seqp = seq;
|
||||||
if (unlikely(dentry->d_flags & DCACHE_OP_REVALIDATE))
|
status = d_revalidate(dentry, nd->flags);
|
||||||
status = d_revalidate(dentry, nd->flags);
|
if (likely(status > 0)) {
|
||||||
if (unlikely(status <= 0)) {
|
|
||||||
if (unlazy_walk(nd, dentry, seq))
|
|
||||||
return -ECHILD;
|
|
||||||
if (status == -ECHILD)
|
|
||||||
status = d_revalidate(dentry, nd->flags);
|
|
||||||
} else {
|
|
||||||
/*
|
/*
|
||||||
* Note: do negative dentry check after revalidation in
|
* Note: do negative dentry check after revalidation in
|
||||||
* case that drops it.
|
* case that drops it.
|
||||||
|
@ -1589,15 +1590,17 @@ static int lookup_fast(struct nameidata *nd,
|
||||||
path->dentry = dentry;
|
path->dentry = dentry;
|
||||||
if (likely(__follow_mount_rcu(nd, path, inode, seqp)))
|
if (likely(__follow_mount_rcu(nd, path, inode, seqp)))
|
||||||
return 1;
|
return 1;
|
||||||
if (unlazy_walk(nd, dentry, seq))
|
|
||||||
return -ECHILD;
|
|
||||||
}
|
}
|
||||||
|
if (unlazy_child(nd, dentry, seq))
|
||||||
|
return -ECHILD;
|
||||||
|
if (unlikely(status == -ECHILD))
|
||||||
|
/* we'd been told to redo it in non-rcu mode */
|
||||||
|
status = d_revalidate(dentry, nd->flags);
|
||||||
} else {
|
} else {
|
||||||
dentry = __d_lookup(parent, &nd->last);
|
dentry = __d_lookup(parent, &nd->last);
|
||||||
if (unlikely(!dentry))
|
if (unlikely(!dentry))
|
||||||
return 0;
|
return 0;
|
||||||
if (unlikely(dentry->d_flags & DCACHE_OP_REVALIDATE))
|
status = d_revalidate(dentry, nd->flags);
|
||||||
status = d_revalidate(dentry, nd->flags);
|
|
||||||
}
|
}
|
||||||
if (unlikely(status <= 0)) {
|
if (unlikely(status <= 0)) {
|
||||||
if (!status)
|
if (!status)
|
||||||
|
@ -1636,8 +1639,7 @@ again:
|
||||||
if (IS_ERR(dentry))
|
if (IS_ERR(dentry))
|
||||||
goto out;
|
goto out;
|
||||||
if (unlikely(!d_in_lookup(dentry))) {
|
if (unlikely(!d_in_lookup(dentry))) {
|
||||||
if ((dentry->d_flags & DCACHE_OP_REVALIDATE) &&
|
if (!(flags & LOOKUP_NO_REVAL)) {
|
||||||
!(flags & LOOKUP_NO_REVAL)) {
|
|
||||||
int error = d_revalidate(dentry, flags);
|
int error = d_revalidate(dentry, flags);
|
||||||
if (unlikely(error <= 0)) {
|
if (unlikely(error <= 0)) {
|
||||||
if (!error) {
|
if (!error) {
|
||||||
|
@ -1668,7 +1670,7 @@ static inline int may_lookup(struct nameidata *nd)
|
||||||
int err = inode_permission(nd->inode, MAY_EXEC|MAY_NOT_BLOCK);
|
int err = inode_permission(nd->inode, MAY_EXEC|MAY_NOT_BLOCK);
|
||||||
if (err != -ECHILD)
|
if (err != -ECHILD)
|
||||||
return err;
|
return err;
|
||||||
if (unlazy_walk(nd, NULL, 0))
|
if (unlazy_walk(nd))
|
||||||
return -ECHILD;
|
return -ECHILD;
|
||||||
}
|
}
|
||||||
return inode_permission(nd->inode, MAY_EXEC);
|
return inode_permission(nd->inode, MAY_EXEC);
|
||||||
|
@ -1703,9 +1705,17 @@ static int pick_link(struct nameidata *nd, struct path *link,
|
||||||
error = nd_alloc_stack(nd);
|
error = nd_alloc_stack(nd);
|
||||||
if (unlikely(error)) {
|
if (unlikely(error)) {
|
||||||
if (error == -ECHILD) {
|
if (error == -ECHILD) {
|
||||||
if (unlikely(unlazy_link(nd, link, seq)))
|
if (unlikely(!legitimize_path(nd, link, seq))) {
|
||||||
return -ECHILD;
|
drop_links(nd);
|
||||||
error = nd_alloc_stack(nd);
|
nd->depth = 0;
|
||||||
|
nd->flags &= ~LOOKUP_RCU;
|
||||||
|
nd->path.mnt = NULL;
|
||||||
|
nd->path.dentry = NULL;
|
||||||
|
if (!(nd->flags & LOOKUP_ROOT))
|
||||||
|
nd->root.mnt = NULL;
|
||||||
|
rcu_read_unlock();
|
||||||
|
} else if (likely(unlazy_walk(nd)) == 0)
|
||||||
|
error = nd_alloc_stack(nd);
|
||||||
}
|
}
|
||||||
if (error) {
|
if (error) {
|
||||||
path_put(link);
|
path_put(link);
|
||||||
|
@ -2122,7 +2132,7 @@ OK:
|
||||||
}
|
}
|
||||||
if (unlikely(!d_can_lookup(nd->path.dentry))) {
|
if (unlikely(!d_can_lookup(nd->path.dentry))) {
|
||||||
if (nd->flags & LOOKUP_RCU) {
|
if (nd->flags & LOOKUP_RCU) {
|
||||||
if (unlazy_walk(nd, NULL, 0))
|
if (unlazy_walk(nd))
|
||||||
return -ECHILD;
|
return -ECHILD;
|
||||||
}
|
}
|
||||||
return -ENOTDIR;
|
return -ENOTDIR;
|
||||||
|
@ -2579,7 +2589,7 @@ mountpoint_last(struct nameidata *nd)
|
||||||
|
|
||||||
/* If we're in rcuwalk, drop out of it to handle last component */
|
/* If we're in rcuwalk, drop out of it to handle last component */
|
||||||
if (nd->flags & LOOKUP_RCU) {
|
if (nd->flags & LOOKUP_RCU) {
|
||||||
if (unlazy_walk(nd, NULL, 0))
|
if (unlazy_walk(nd))
|
||||||
return -ECHILD;
|
return -ECHILD;
|
||||||
}
|
}
|
||||||
|
|
||||||
|
@ -3072,9 +3082,6 @@ static int lookup_open(struct nameidata *nd, struct path *path,
|
||||||
if (d_in_lookup(dentry))
|
if (d_in_lookup(dentry))
|
||||||
break;
|
break;
|
||||||
|
|
||||||
if (!(dentry->d_flags & DCACHE_OP_REVALIDATE))
|
|
||||||
break;
|
|
||||||
|
|
||||||
error = d_revalidate(dentry, nd->flags);
|
error = d_revalidate(dentry, nd->flags);
|
||||||
if (likely(error > 0))
|
if (likely(error > 0))
|
||||||
break;
|
break;
|
||||||
|
|
Loading…
Add table
Add a link
Reference in a new issue