| commit | 97855b49b6bac0bd25f16b017883634d13591d00 | |
| author | J. Bruce Fields <bfields@citi.umich.edu> | |
| Tue, 30 Oct 2007 15:20:02 +0000 (30 11:20 -0400) | ||
| committer | Linus Torvalds <torvalds@woody.linux-foundation.org> | |
| Tue, 30 Oct 2007 16:04:18 +0000 (30 09:04 -0700) | ||
| tree | e0895adabfda85bd9dc7514265940fdef8b1e506 | treesnapshot (tar.gz zip) |
| parent | fb7267acfef1de3e49d4e0c80be3cc603e974b3b | commitdiff |
locks: fix possible infinite loop in posix deadlock detection
It's currently possible to send posix_locks_deadlock() into an infinite
loop (under the BKL).
For now, fix this just by bailing out after a few iterations. We may
want to fix this in a way that better clarifies the semantics of
deadlock detection. But that will take more time, and this minimal fix
is probably adequate for any realistic scenario, and is simple enough to
be appropriate for applying to stable kernels now.
Thanks to George Davis for reporting the problem.
Cc: "George G. Davis" <gdavis@mvista.com>
Signed-off-by: J. Bruce Fields <bfields@citi.umich.edu>
Acked-by: Alan Cox <alan@redhat.com>
Signed-off-by: Linus Torvalds <torvalds@linux-foundation.org>
It's currently possible to send posix_locks_deadlock() into an infinite
loop (under the BKL).
For now, fix this just by bailing out after a few iterations. We may
want to fix this in a way that better clarifies the semantics of
deadlock detection. But that will take more time, and this minimal fix
is probably adequate for any realistic scenario, and is simple enough to
be appropriate for applying to stable kernels now.
Thanks to George Davis for reporting the problem.
Cc: "George G. Davis" <gdavis@mvista.com>
Signed-off-by: J. Bruce Fields <bfields@citi.umich.edu>
Acked-by: Alan Cox <alan@redhat.com>
Signed-off-by: Linus Torvalds <torvalds@linux-foundation.org>
| fs/locks.c | diffblobblamehistory |