mirror of
https://github.com/torvalds/linux.git
synced 2024-12-29 06:12:08 +00:00
do "fold checks into iterate_and_advance()" right
the only case when we should skip the iterate_and_advance() guts is when nothing's left in the iterator, _not_ just when requested amount is 0. Said guts will do nothing in the latter case anyway; the problem we tried to deal with in the aforementioned commit is that when there's nothing left *and* the amount requested is 0, we might end up deferencing one iovec too many; the value we fetch from there is discarded in that case, but theoretically it might oops if the iovec array ends exactly at the end of page with the next page not mapped. Bailing out on zero size requested had an unexpected side effect - zero-length segment in the beginning of iovec array ended up throwing do_loop_readv_writev() into infinite spin; we do not advance past the empty segment at all. Reproducer is trivial: echo '#include <sys/uio.h>' >a.c echo 'main() {char c; struct iovec v[] = {{&c,0},{&c,1}}; readv(0,v,2);}' >>a.c cc a.c && ./a.out </proc/uptime which should end up with the process not hanging. Probably ought to go into LTP or xfstests... Signed-off-by: Al Viro <viro@zeniv.linux.org.uk>
This commit is contained in:
parent
dd254f5a38
commit
19f1845933
@ -101,7 +101,7 @@
|
|||||||
#define iterate_and_advance(i, n, v, I, B, K) { \
|
#define iterate_and_advance(i, n, v, I, B, K) { \
|
||||||
if (unlikely(i->count < n)) \
|
if (unlikely(i->count < n)) \
|
||||||
n = i->count; \
|
n = i->count; \
|
||||||
if (n) { \
|
if (i->count) { \
|
||||||
size_t skip = i->iov_offset; \
|
size_t skip = i->iov_offset; \
|
||||||
if (unlikely(i->type & ITER_BVEC)) { \
|
if (unlikely(i->type & ITER_BVEC)) { \
|
||||||
const struct bio_vec *bvec; \
|
const struct bio_vec *bvec; \
|
||||||
|
Loading…
Reference in New Issue
Block a user