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 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220
// Copyright (c) 2021, BlockProject 3D
//
// All rights reserved.
//
// Redistribution and use in source and binary forms, with or without modification,
// are permitted provided that the following conditions are met:
//
// * Redistributions of source code must retain the above copyright notice,
// this list of conditions and the following disclaimer.
// * Redistributions in binary form must reproduce the above copyright notice,
// this list of conditions and the following disclaimer in the documentation
// and/or other materials provided with the distribution.
// * Neither the name of BlockProject 3D nor the names of its contributors
// may be used to endorse or promote products derived from this software
// without specific prior written permission.
//
// THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
// "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
// LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
// A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR
// CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL,
// EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,
// PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR
// PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF
// LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING
// NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
// SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
//! A thread pool with support for function results
use crossbeam_channel::{bounded, unbounded, Receiver, Sender};
use std::iter::repeat_with;
use std::time::Duration;
struct Task<'env, T: Send + 'static> {
func: Box<dyn FnOnce(usize) -> T + Send + 'env>,
id: usize,
}
fn thread_pool_worker<T: Send>(tasks: Receiver<Task<T>>, out: Sender<T>) {
while let Ok(v) = tasks.try_recv() {
let res = (v.func)(v.id);
if out.send(res).is_err() {
break;
}
}
// Wait 100ms before running the next iteration to let a chance to the main thread to refill the task channel.
std::thread::sleep(Duration::from_millis(100));
}
/// Trait to access the join function of a thread handle.
pub trait Join {
/// Joins this thread.
fn join(self) -> std::thread::Result<()>;
}
/// Trait to handle spawning generic threads.
pub trait ThreadManager<'env> {
/// The type of thread handle (must have a join() function).
type Handle: Join;
/// Spawns a thread using this manager.
///
/// # Arguments
///
/// * `func`: the function to run in the thread.
///
/// returns: Self::Handle
fn spawn_thread<F: FnOnce() + Send + 'env>(&self, func: F) -> Self::Handle;
}
/// Core thread pool.
pub struct ThreadPool<'env, Manager: ThreadManager<'env>, T: Send + 'static> {
end_channel_out: Receiver<T>,
end_channel_in: Sender<T>,
task_channel_out: Receiver<Task<'env, T>>,
task_channel_in: Sender<Task<'env, T>>,
term_channel_out: Receiver<usize>,
term_channel_in: Sender<usize>,
n_threads: usize,
threads: Box<[Option<Manager::Handle>]>,
running_threads: usize,
task_id: usize,
}
impl<'env, Manager: ThreadManager<'env>, T: Send> ThreadPool<'env, Manager, T> {
/// Creates a new thread pool
///
/// # Arguments
///
/// * `n_threads`: maximum number of threads allowed to run at the same time.
///
/// returns: ThreadPool<T, Manager>
///
/// # Examples
///
/// ```
/// use bp3d_threads::UnscopedThreadManager;
/// use bp3d_threads::ThreadPool;
/// let _: ThreadPool<UnscopedThreadManager, ()> = ThreadPool::new(4);
/// ```
pub fn new(n_threads: usize) -> Self {
let (end_channel_in, end_channel_out) = unbounded();
let (task_channel_in, task_channel_out) = unbounded();
let (term_channel_in, term_channel_out) = bounded(n_threads);
Self {
end_channel_out,
end_channel_in,
task_channel_out,
task_channel_in,
term_channel_out,
term_channel_in,
n_threads,
running_threads: 0,
threads: repeat_with(|| None)
.take(n_threads)
.collect::<Vec<Option<Manager::Handle>>>()
.into_boxed_slice(),
task_id: 0,
}
}
fn rearm_one_thread_if_possible(&mut self, manager: &Manager) {
if self.running_threads < self.n_threads {
for (i, handle) in self.threads.iter_mut().enumerate() {
if handle.is_none() {
let tasks = self.task_channel_out.clone();
let out = self.end_channel_in.clone();
let term = self.term_channel_in.clone();
*handle = Some(manager.spawn_thread(move || {
thread_pool_worker(tasks, out);
term.send(i).unwrap();
}));
break;
}
}
self.running_threads += 1;
}
}
/// Schedule a new task to run.
///
/// Returns true if the task was successfully scheduled, false otherwise.
///
/// **The task execution order is not guaranteed,
/// however the task index is guaranteed to be the order of the call to dispatch.**
///
/// **If a task panics it will leave a dead thread in the corresponding slot until .join() is called.**
///
/// # Arguments
///
/// * `manager`: the thread manager to spawn a new thread if needed.
/// * `f`: the task function to execute.
///
/// returns: bool
///
/// # Examples
///
/// ```
/// use bp3d_threads::UnscopedThreadManager;
/// use bp3d_threads::ThreadPool;
/// let manager = UnscopedThreadManager::new();
/// let mut pool: ThreadPool<UnscopedThreadManager, ()> = ThreadPool::new(4);
/// pool.dispatch(&manager, |_| ());
/// ```
pub fn dispatch<F: FnOnce(usize) -> T + Send + 'env>(
&mut self,
manager: &Manager,
f: F,
) -> bool {
let task = Task {
func: Box::new(f),
id: self.task_id,
};
if self.task_channel_in.send(task).is_err() {
return false;
}
self.task_id += 1;
self.rearm_one_thread_if_possible(manager);
true
}
/// Returns true if this thread pool is idle.
///
/// **An idle thread pool does neither have running threads nor waiting tasks
/// but may still have waiting results to poll.**
pub fn is_idle(&self) -> bool {
self.task_channel_in.is_empty() && self.running_threads == 0
}
/// Poll a result from this thread pool if any, returns None if no result is available.
pub fn poll(&mut self) -> Option<T> {
if let Ok(v) = self.term_channel_out.try_recv() {
self.threads[v] = None;
self.running_threads -= 1;
}
match self.end_channel_out.try_recv() {
Ok(v) => Some(v),
Err(_) => None,
}
}
/// Waits for all tasks to finish execution and stops all threads.
///
/// *Use this to periodically clean-up the thread pool, if you know that some tasks may panic.*
///
/// # Errors
///
/// Returns an error if a thread did panic.
pub fn join(&mut self) -> std::thread::Result<()> {
for handle in self.threads.iter_mut() {
if let Some(h) = handle.take() {
h.join()?;
self.term_channel_out.recv().unwrap();
self.running_threads -= 1;
}
}
Ok(())
}
}