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

use crate::fib::FiberRoot;
use core::{
    pin::Pin,
    ptr,
    sync::atomic::{AtomicPtr, Ordering},
};

/// A lock-free stack of fibers.
pub struct Chain {
    head: AtomicPtr<Node>,
}

struct Node {
    fib: Pin<Box<dyn FiberRoot>>,
    next: *mut Node,
}

impl Chain {
    /// Creates an empty fiber chain.
    pub const fn new() -> Self {
        Self {
            head: AtomicPtr::new(ptr::null_mut()),
        }
    }

    /// Adds the fiber `fib` first to the chain.
    pub fn add<F: FiberRoot>(&self, fib: F) {
        self.push(Node::new(fib));
    }

    /// Returns `true` if the chain contains no fibers.
    pub fn is_empty(&self) -> bool {
        self.head.load(Ordering::Acquire).is_null()
    }

    /// Advances fibers, removing completed ones.
    ///
    /// # Safety
    ///
    /// This method is not reentrant.
    #[inline(never)]
    pub unsafe fn drain(&self) {
        let mut prev = ptr::null_mut();
        let mut curr = self.head.load(Ordering::Acquire);
        while !curr.is_null() {
            let next = (*curr).next;
            if (*curr).fib.as_mut().advance() {
                prev = curr;
            } else {
                if prev.is_null() {
                    prev = self.head.compare_and_swap(curr, next, Ordering::Relaxed);
                    if prev == curr {
                        prev = ptr::null_mut();
                    } else {
                        loop {
                            prev = (*prev).next;
                            if prev == curr {
                                (*prev).next = next;
                                break;
                            }
                        }
                    }
                } else {
                    (*prev).next = next;
                }
                drop(Box::from_raw(curr));
            }
            curr = next;
        }
    }

    fn push(&self, node: Node) {
        let node = Box::into_raw(Box::new(node));
        loop {
            let head = self.head.load(Ordering::Relaxed);
            unsafe { (*node).next = head };
            if self.head.compare_and_swap(head, node, Ordering::Release) == head {
                break;
            }
        }
    }
}

impl Node {
    fn new<F: FiberRoot>(fib: F) -> Self {
        Self {
            fib: Box::pin(fib),
            next: ptr::null_mut(),
        }
    }
}