On Thu, Jul 25, 2024 at 11:15:03AM +0200, Stefano Brivio wrote: > On Thu, 25 Jul 2024 14:37:43 +1000 > David Gibson wrote: > > > On Wed, Jul 24, 2024 at 11:50:16PM +0200, Stefano Brivio wrote: > > > This was reported by Matej a while ago, but we forgot to fix it. Even > > > if the hypervisor is necessarily trusted by passt, as it can in any > > > case terminate the guest or disrupt guest connectivity, it's a good > > > idea to be robust against possible issues. > > > > > > Instead of resetting the connection to the hypervisor, just discard > > > the data we read with a single recv(), as we had a few cases where > > > QEMU would get the length descriptor wrong, in the past. > > > > > > While at it, change l2len in tap_handler_passt() to uint32_t, as the > > > length descriptor is logically unsigned and 32-bit wide. > > > > > > Reported-by: Matej Hrica > > > Suggested-by: Matej Hrica > > > Signed-off-by: Stefano Brivio > > > --- > > > tap.c | 10 ++++++---- > > > 1 file changed, 6 insertions(+), 4 deletions(-) > > > > > > diff --git a/tap.c b/tap.c > > > index 44bd444..62ba6a4 100644 > > > --- a/tap.c > > > +++ b/tap.c > > > @@ -1011,15 +1011,18 @@ redo: > > > } > > > > > > while (n > (ssize_t)sizeof(uint32_t)) { > > > - ssize_t l2len = ntohl(*(uint32_t *)p); > > > + uint32_t l2len = ntohl(*(uint32_t *)p); > > > > > > p += sizeof(uint32_t); > > > n -= sizeof(uint32_t); > > > > > > + if (l2len > (ssize_t)TAP_BUF_BYTES - n) > > > + return; > > > > Neither the condition nor the action makes much sense to me here. > > We're testing if the frame can fit in the the remaining buffer space. > > Not really, we're just checking that the length descriptor fits the > remaining buffer space. We're using this in the second recv() below, > that's why it matters here. But AFAICT, what we need to know is if the remainder of the frame fits in the buffer. That could be less than the length descriptor if we've already recv()ed part of a frame. > > But we may have already read part (or all) of the frame - i.e. it's > > included in 'n'. So I don't see how that condition is useful. > > ...that is, it has nothing to do with exceeding or not exceeding the > buffer on recv(), that's already taken care of by the recv() call, > implicitly. > > > Then, simply returning doesn't seem right under pretty much any > > circumstances - that discards some amount of data, and leaves us in an > > unsynchronized state w.r.t. the frame boundaries. > > That might happen, of course, but it might also happen that the > hypervisor sent us *one* corrupted buffer, and the next recv() will > read consistent data. Well, sure, it's possible, but it doesn't seem particularly likely to me. AFAICT this is a stream which we need every length field to interpret properly. If we lose one, or it's corrupted, I think we're done for. > > If this is just supposed to be a sanity check on the frame length, > > then I think we'd be better off with a fixed limit - 64kiB is the > > obvious choice. > > That's already checked below (l2len > ETH_MAX_MTU), and... Right. I wonder if it would make sense to do that earlier. > > If we hit that, we can warn() and discard data up to > > the end of the too-large frame. That at least has a chance of letting > > us recover and move on to future acceptable frames. > > that's exactly what we do in that case (goto next). Only for the case that the length is too long, but not *too* long. In particular it needs to fit in the buffer to even get there. If we sanity checked the frame length earlier we could use MSG_TRUNC to discard even a ludicrously large frame and still continue on to the next one. > > > /* At most one packet might not fit in a single read, and this > > > * needs to be blocking. > > > */ > > > - if (l2len > n) { > > > + if (l2len > (size_t)n) { > > > rem = recv(c->fd_tap, p + n, l2len - n, 0); > ^^^^^^^^^^^^^^^^ > > This the reason why the check above is relevant. Relevant, sure, but I still don't think it's right. Actually (TAP_BUF_BYTES - n) is an even stranger quantity than I initially thought. It's the total space of the buffer minus the current partial frame - counting *both* the stuff before our partial frame and after it. I think instead we need to check for (p + l2len > pkt_buf + TAP_BUF_BYTES). > > > if ((n += rem) != l2len) > > > return; > > > > Pre-existing, but a 'return' here basically lands us in a situation we > > have no meaningful chance of recovering from. A die() would be > > preferable. Better yet would be continuing to re-recv() until we have > > the whole frame, similar to what we do for write_remainder(). > > Same as above, it depends on what failure you're assuming. If it's just > one botched recv(), instead, we recv() again the next time and we > recover. Even if it's just one bad recv(), we still have no idea where we are w.r.t. frame boundaries, so I can't see any way we could recover. > But yes, the first attempt should probably be to recv() the rest of the > frame. I didn't implement this because it adds complexity and I think > that, eventually, we should turn this into a proper ringbuffer anyway. > > > > @@ -1028,8 +1031,7 @@ redo: > > > /* Complete the partial read above before discarding a malformed > > > * frame, otherwise the stream will be inconsistent. > > > */ > > > - if (l2len < (ssize_t)sizeof(struct ethhdr) || > > > - l2len > (ssize_t)ETH_MAX_MTU) > > > + if (l2len < sizeof(struct ethhdr) || l2len > ETH_MAX_MTU) > > > goto next; > > > tap_add_packet(c, l2len, p); > -- David Gibson (he or they) | I'll have my music baroque, and my code david AT gibson.dropbear.id.au | minimalist, thank you, not the other way | around. http://www.ozlabs.org/~dgibson