From: Al Viro <viro@xxxxxxxxxxxxxxxx> > Sent: 10 September 2021 03:48 > > On Thu, Sep 09, 2021 at 07:35:13PM -0600, Jens Axboe wrote: > > > Yep ok I follow you now. And yes, if we get a partial one but one that > > has more consumed than what was returned, that would not work well. I'm > > guessing that a) we've never seen that, or b) we always end up with > > either correctly advanced OR fully advanced, and the fully advanced case > > would then just return 0 next time and we'd just get a short IO back to > > userspace. > > > > The safer way here would likely be to import the iovec again. We're > > still in the context of the original submission, and the sqe hasn't been > > consumed in the ring yet, so that can be done safely. > > ... until you end up with something assuming that you've got the same > iovec from userland the second time around. > > IOW, generally it's a bad idea to do that kind of re-imports. IIRC the canonical 'import' code is something like: struct iov iov[8], *cache = iov; struct iter; iov_iter_import(&iter, ... , &cache, 8); result = .... if (cache != iov) kfree(cache); return result; The iov[] and 'cache' are always allocated on stack with 'iter'. Now processing the 'iter' advances iter->iov. So to reset you need the start point - which is either 'cache' or 'iov[]'. The outer caller (typically) has this information. But the inner functions don't. Move both 'iov[]' and 'cache' into struct iter and they become available to all the code. It would also simplify the currently horrid boilerplate code that is replicated for every user. You might need a 'offset in current iter->iov[]' but nothing else. David - Registered Address Lakeside, Bramley Road, Mount Farm, Milton Keynes, MK1 1PT, UK Registration No: 1397386 (Wales)
