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
 55
 56
 57
 58
 59
 60
 61
 62
 63
 64
 65
 66
 67
 68
 69
 70
 71
 72
 73
 74
 75
 76
 77
 78
 79
 80
 81
 82
 83
 84
 85
 86
 87
 88
 89
 90
 91
 92
 93
 94
 95
 96
 97
 98
 99
100
/*
 * Copyright (c) Facebook, Inc. and its affiliates.
 *
 * This source code is licensed under the MIT license found in the
 * LICENSE file in the root directory of this source tree.
 */

use crate::{make_ops, PartialOp};
use std::{
    cmp, io,
    task::{Context, Poll},
};

pub(crate) struct FuturesOps {
    ops: Box<dyn Iterator<Item = PartialOp> + Send>,
}

impl FuturesOps {
    /// Creates a new instance of `TokioOps`.
    pub(crate) fn new<I>(iter: I) -> Self
    where
        I: IntoIterator<Item = PartialOp> + 'static,
        I::IntoIter: Send,
    {
        Self {
            ops: make_ops(iter),
        }
    }

    /// Replaces ops with a new iterator.
    pub(crate) fn replace<I>(&mut self, iter: I)
    where
        I: IntoIterator<Item = PartialOp> + 'static,
        I::IntoIter: Send,
    {
        self.ops = make_ops(iter)
    }

    /// Helper for poll methods.
    ///
    /// `cb` is the callback that implements the actual logic. The second argument is `Some(n)` to
    /// limit the number of bytes being written, or `None` for unlimited.
    pub(crate) fn poll_impl<T>(
        &mut self,
        cx: &mut Context,
        cb: impl FnOnce(&mut Context, Option<usize>) -> Poll<io::Result<T>>,
        remaining: usize,
        err_str: &'static str,
    ) -> Poll<io::Result<T>> {
        loop {
            match self.ops.next() {
                Some(PartialOp::Limited(n)) => {
                    let len = cmp::min(n, remaining);
                    break cb(cx, Some(len));
                }
                Some(PartialOp::Err(kind)) => {
                    if kind == io::ErrorKind::WouldBlock {
                        // Async* instances must convert WouldBlock errors to Poll::Pending and
                        // reschedule the task.
                        cx.waker().wake_by_ref();
                        break Poll::Pending;
                    } else if kind == io::ErrorKind::Interrupted {
                        // Async* instances must retry on Interrupted errors.
                        continue;
                    } else {
                        break Poll::Ready(Err(io::Error::new(kind, err_str)));
                    }
                }
                Some(PartialOp::Unlimited) | None => break cb(cx, None),
            }
        }
    }

    /// Helper for poll methods that ignore the length specified in `PartialOp::Limited`.
    pub(crate) fn poll_impl_no_limit<T>(
        &mut self,
        cx: &mut Context,
        cb: impl FnOnce(&mut Context) -> Poll<io::Result<T>>,
        err_str: &'static str,
    ) -> Poll<io::Result<T>> {
        loop {
            match self.ops.next() {
                Some(PartialOp::Err(kind)) => {
                    if kind == io::ErrorKind::WouldBlock {
                        // Async* instances must convert WouldBlock errors to Poll::Pending and
                        // reschedule the task.
                        cx.waker().wake_by_ref();
                        break Poll::Pending;
                    } else if kind == io::ErrorKind::Interrupted {
                        // Async* instances must retry on interrupted errors.
                        continue;
                    } else {
                        break Poll::Ready(Err(io::Error::new(kind, err_str)));
                    }
                }
                _ => break cb(cx),
            }
        }
    }
}