diff options
author | David Jeffery <djeffery@redhat.com> | 2013-07-10 13:19:50 -0400 |
---|---|---|
committer | J. Bruce Fields <bfields@redhat.com> | 2013-07-11 17:24:07 -0400 |
commit | 1c327d962fc420aea046c16215a552710bde8231 (patch) | |
tree | 2ab025c8b577d7fe338b1530bea72c3fa0ef0d72 /fs/lockd | |
parent | d109148111cdfcdae94f797dc142468bd0ff7557 (diff) |
lockd: protect nlm_blocked access in nlmsvc_retry_blocked
In nlmsvc_retry_blocked, the check that the list is non-empty and acquiring
the pointer of the first entry is unprotected by any lock. This allows a rare
race condition when there is only one entry on the list. A function such as
nlmsvc_grant_callback() can be called, which will temporarily remove the entry
from the list. Between the list_empty() and list_entry(),the list may become
empty, causing an invalid pointer to be used as an nlm_block, leading to a
possible crash.
This patch adds the nlm_block_lock around these calls to prevent concurrent
use of the nlm_blocked list.
This was a regression introduced by
f904be9cc77f361d37d71468b13ff3d1a1823dea "lockd: Mostly remove BKL from
the server".
Cc: Bryan Schumaker <bjschuma@netapp.com>
Cc: stable@vger.kernel.org
Signed-off-by: David Jeffery <djeffery@redhat.com>
Signed-off-by: J. Bruce Fields <bfields@redhat.com>
Diffstat (limited to 'fs/lockd')
-rw-r--r-- | fs/lockd/svclock.c | 4 |
1 files changed, 4 insertions, 0 deletions
diff --git a/fs/lockd/svclock.c b/fs/lockd/svclock.c index e703318c41df..8ebd3f551e0c 100644 --- a/fs/lockd/svclock.c +++ b/fs/lockd/svclock.c | |||
@@ -939,6 +939,7 @@ nlmsvc_retry_blocked(void) | |||
939 | unsigned long timeout = MAX_SCHEDULE_TIMEOUT; | 939 | unsigned long timeout = MAX_SCHEDULE_TIMEOUT; |
940 | struct nlm_block *block; | 940 | struct nlm_block *block; |
941 | 941 | ||
942 | spin_lock(&nlm_blocked_lock); | ||
942 | while (!list_empty(&nlm_blocked) && !kthread_should_stop()) { | 943 | while (!list_empty(&nlm_blocked) && !kthread_should_stop()) { |
943 | block = list_entry(nlm_blocked.next, struct nlm_block, b_list); | 944 | block = list_entry(nlm_blocked.next, struct nlm_block, b_list); |
944 | 945 | ||
@@ -948,6 +949,7 @@ nlmsvc_retry_blocked(void) | |||
948 | timeout = block->b_when - jiffies; | 949 | timeout = block->b_when - jiffies; |
949 | break; | 950 | break; |
950 | } | 951 | } |
952 | spin_unlock(&nlm_blocked_lock); | ||
951 | 953 | ||
952 | dprintk("nlmsvc_retry_blocked(%p, when=%ld)\n", | 954 | dprintk("nlmsvc_retry_blocked(%p, when=%ld)\n", |
953 | block, block->b_when); | 955 | block, block->b_when); |
@@ -957,7 +959,9 @@ nlmsvc_retry_blocked(void) | |||
957 | retry_deferred_block(block); | 959 | retry_deferred_block(block); |
958 | } else | 960 | } else |
959 | nlmsvc_grant_blocked(block); | 961 | nlmsvc_grant_blocked(block); |
962 | spin_lock(&nlm_blocked_lock); | ||
960 | } | 963 | } |
964 | spin_unlock(&nlm_blocked_lock); | ||
961 | 965 | ||
962 | return timeout; | 966 | return timeout; |
963 | } | 967 | } |