1
 2
 3
 4
 5
 6
 7
 8
 9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
use core::future;
use core::pin;
use core::task;

#[derive(Debug)]
#[must_use = "futures do nothing unless you `.await` or poll them"]
pub struct ReadExact<'a, A>
where
    A: super::Read + Unpin + ?Sized,
{
    reader: &'a mut A,
    buffer: &'a mut [u8],
    position: usize,
}

pub fn read_exact<'a, A>(reader: &'a mut A, buffer: &'a mut [u8]) -> ReadExact<'a, A>
where
    A: super::Read + Unpin + ?Sized,
{
    let position = 0;
    ReadExact {
        reader,
        buffer,
        position,
    }
}

impl<A> future::Future for ReadExact<'_, A>
where
    A: super::Read + Unpin + ?Sized,
{
    type Output = Result<usize, A::Error>;

    fn poll(mut self: pin::Pin<&mut Self>, cx: &mut task::Context<'_>) -> task::Poll<Self::Output> {
        use super::ReadError;

        loop {
            // if our buffer is empty, then we need to read some data to continue.
            if self.position < self.buffer.len() {
                let this = &mut *self;
                let n = futures::ready!(pin::Pin::new(&mut *this.reader)
                    .poll_read(cx, &mut this.buffer[this.position..]))?;
                this.position += n;
                if n == 0 {
                    return Err(A::Error::eof()).into();
                }
            }

            if self.position >= self.buffer.len() {
                return task::Poll::Ready(Ok(self.position));
            }
        }
    }
}