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 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 355 356 357 358 359 360 361 362 363 364 365 366 367 368 369 370 371 372 373 374 375 376 377 378 379 380 381 382 383 384 385 386 387 388 389 390 391 392 393 394 395 396 397 398 399 400 401 402 403 404 405 406 407 408 409 410 411 412 413 414 415 416 417 418 419 420 421 422 423 424 425 426 427 428 429 430 431 432 433 434 435 436 437 438 439 440 441 442 443 444 445 446 447 448 449 450 451 452 453 454 455 456 457 458 459 460 461 462 463
// Copyright 2018 Parity Technologies (UK) Ltd. // // Permission is hereby granted, free of charge, to any person obtaining a // copy of this software and associated documentation files (the "Software"), // to deal in the Software without restriction, including without limitation // the rights to use, copy, modify, merge, publish, distribute, sublicense, // and/or sell copies of the Software, and to permit persons to whom the // Software is furnished to do so, subject to the following conditions: // // The above copyright notice and this permission notice shall be included in // all copies or substantial portions of the Software. // // THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS // OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, // FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE // AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER // LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING // FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER // DEALINGS IN THE SOFTWARE. use crate::{ Executor, PeerId, muxing::StreamMuxer, nodes::{ handled_node::{HandledNode, IntoNodeHandler, NodeHandler}, node::Substream } }; use fnv::FnvHashMap; use futures::{prelude::*, channel::mpsc, stream::FuturesUnordered}; use std::{collections::hash_map::{Entry, OccupiedEntry}, error, fmt, pin::Pin, task::Context, task::Poll}; use super::{TaskId, task::{Task, FromTaskMessage, ToTaskMessage}, Error}; // Implementor notes // ================= // // This collection of nodes spawns a `Task` for each individual node to process. // This means that events happen asynchronously at the same time as the // `Manager` is being polled. // // In order to make the API non-racy and avoid issues, we completely separate // the state in the `Manager` from the states that the `Task` can access. // They are only allowed to exchange messages. The state in the `Manager` is // therefore delayed compared to the tasks, and is updated only when `poll()` // is called. // // The only thing that we must be careful about is substreams, as they are // "detached" from the state of the `Manager` and allowed to process // concurrently. This is why there is no "substream closed" event being // reported, as it could potentially create confusions and race conditions in // the user's code. See similar comments in the documentation of `NodeStream`. // /// Implementation of [`Stream`] that handles a collection of nodes. pub struct Manager<I, O, H, E, HE, T, C = PeerId> { /// Collection of managed tasks. /// /// Closing the sender interrupts the task. It is possible that we receive /// messages from tasks that used to be in this collection but no longer /// are, in which case we should ignore them. tasks: FnvHashMap<TaskId, TaskInfo<I, T>>, /// Identifier for the next task to spawn. next_task_id: TaskId, /// Custom executor where we spawn the nodes' tasks. If `None`, then we push tasks to the /// `local_spawns` list instead. executor: Option<Box<dyn Executor + Send>>, /// If no executor is available, we move tasks to this set, and futures are polled on the /// current thread instead. local_spawns: FuturesUnordered<Pin<Box<dyn Future<Output = ()> + Send>>>, /// Sender to emit events to the outside. Meant to be cloned and sent to tasks. events_tx: mpsc::Sender<(FromTaskMessage<O, H, E, HE, C>, TaskId)>, /// Receiver side for the events. events_rx: mpsc::Receiver<(FromTaskMessage<O, H, E, HE, C>, TaskId)> } impl<I, O, H, E, HE, T, C> fmt::Debug for Manager<I, O, H, E, HE, T, C> where T: fmt::Debug { fn fmt(&self, f: &mut fmt::Formatter) -> fmt::Result { f.debug_map() .entries(self.tasks.iter().map(|(id, task)| (id, &task.user_data))) .finish() } } /// Information about a running task. /// /// Contains the sender to deliver event messages to the task, and /// the associated user data. struct TaskInfo<I, T> { /// channel endpoint to send messages to the task sender: mpsc::Sender<ToTaskMessage<I>>, /// task associated data user_data: T, } /// Event produced by the [`Manager`]. #[derive(Debug)] pub enum Event<'a, I, O, H, E, HE, T, C = PeerId> { /// A task has been closed. /// /// This happens once the node handler closes or an error happens. TaskClosed { /// The task that has been closed. task: ClosedTask<I, T>, /// What happened. result: Error<E, HE>, /// If the task closed before reaching the node, this contains /// the handler that was passed to `add_reach_attempt`. handler: Option<H> }, /// A task has successfully connected to a node. NodeReached { /// The task that succeeded. task: TaskEntry<'a, I, T>, /// Identifier of the node. conn_info: C }, /// A task has produced an event. NodeEvent { /// The task that produced the event. task: TaskEntry<'a, I, T>, /// The produced event. event: O } } impl<I, O, H, E, HE, T, C> Manager<I, O, H, E, HE, T, C> { /// Creates a new task manager. If `Some` is passed, uses the given executor to spawn tasks. /// Otherwise, background tasks are executed locally when you call `poll`. pub fn new(executor: Option<Box<dyn Executor + Send>>) -> Self { let (tx, rx) = mpsc::channel(1); Self { tasks: FnvHashMap::default(), next_task_id: TaskId(0), executor, local_spawns: FuturesUnordered::new(), events_tx: tx, events_rx: rx } } /// Adds to the manager a future that tries to reach a node. /// /// This method spawns a task dedicated to resolving this future and /// processing the node's events. pub fn add_reach_attempt<F, M>(&mut self, future: F, user_data: T, handler: H) -> TaskId where F: Future<Output = Result<(C, M), E>> + Send + 'static, H: IntoNodeHandler<C> + Send + 'static, H::Handler: NodeHandler<Substream = Substream<M>, InEvent = I, OutEvent = O, Error = HE> + Send + 'static, E: error::Error + Send + 'static, HE: error::Error + Send + 'static, I: Send + 'static, O: Send + 'static, <H::Handler as NodeHandler>::OutboundOpenInfo: Send + 'static, M: StreamMuxer + Send + Sync + 'static, M::OutboundSubstream: Send + 'static, C: Send + 'static { let task_id = self.next_task_id; self.next_task_id.0 += 1; let (tx, rx) = mpsc::channel(4); self.tasks.insert(task_id, TaskInfo { sender: tx, user_data }); let task = Box::pin(Task::new(task_id, self.events_tx.clone(), rx, future, handler)); if let Some(executor) = &self.executor { executor.exec(task as Pin<Box<_>>) } else { self.local_spawns.push(task); } task_id } /// Adds an existing connection to a node to the collection. /// /// This method spawns a task dedicated to processing the node's events. /// /// No `NodeReached` event will be emitted for this task, since the node has already been /// reached. pub fn add_connection<M, Handler>(&mut self, user_data: T, muxer: M, handler: Handler) -> TaskId where H: IntoNodeHandler<C, Handler = Handler> + Send + 'static, Handler: NodeHandler<Substream = Substream<M>, InEvent = I, OutEvent = O, Error = HE> + Send + 'static, E: error::Error + Send + 'static, HE: error::Error + Send + 'static, I: Send + 'static, O: Send + 'static, <H::Handler as NodeHandler>::OutboundOpenInfo: Send + 'static, M: StreamMuxer + Send + Sync + 'static, M::OutboundSubstream: Send + 'static, C: Send + 'static { let task_id = self.next_task_id; self.next_task_id.0 += 1; let (tx, rx) = mpsc::channel(4); self.tasks.insert(task_id, TaskInfo { sender: tx, user_data }); let task: Task<Pin<Box<futures::future::Pending<_>>>, _, _, _, _, _, _> = Task::node(task_id, self.events_tx.clone(), rx, HandledNode::new(muxer, handler)); if let Some(executor) = &self.executor { executor.exec(Box::pin(task)) } else { self.local_spawns.push(Box::pin(task)); } task_id } /// Sends a message to all the tasks, including the pending ones. /// /// This function is "atomic", in the sense that if `Poll::Pending` is returned then no event /// has been sent to any node yet. #[must_use] pub fn poll_broadcast(&mut self, event: &I, cx: &mut Context) -> Poll<()> where I: Clone { for task in self.tasks.values_mut() { if let Poll::Pending = task.sender.poll_ready(cx) { return Poll::Pending; } } for task in self.tasks.values_mut() { let msg = ToTaskMessage::HandlerEvent(event.clone()); match task.sender.start_send(msg) { Ok(()) => {}, Err(ref err) if err.is_full() => panic!("poll_ready returned Poll::Ready just above; qed"), Err(_) => {}, } } Poll::Ready(()) } /// Grants access to an object that allows controlling a task of the collection. /// /// Returns `None` if the task id is invalid. pub fn task(&mut self, id: TaskId) -> Option<TaskEntry<'_, I, T>> { match self.tasks.entry(id) { Entry::Occupied(inner) => Some(TaskEntry { inner }), Entry::Vacant(_) => None, } } /// Returns a list of all the active tasks. pub fn tasks<'a>(&'a self) -> impl Iterator<Item = TaskId> + 'a { self.tasks.keys().cloned() } /// Provides an API similar to `Stream`, except that it cannot produce an error. pub fn poll(&mut self, cx: &mut Context) -> Poll<Event<I, O, H, E, HE, T, C>> { // Advance the content of `local_spawns`. while let Poll::Ready(Some(_)) = Stream::poll_next(Pin::new(&mut self.local_spawns), cx) {} let (message, task_id) = loop { match Stream::poll_next(Pin::new(&mut self.events_rx), cx) { Poll::Ready(Some((message, task_id))) => { // If the task id is no longer in `self.tasks`, that means that the user called // `close()` on this task earlier. Therefore no new event should be generated // for this task. if self.tasks.contains_key(&task_id) { break (message, task_id) } } Poll::Pending => return Poll::Pending, Poll::Ready(None) => unreachable!("sender and receiver have same lifetime"), } }; Poll::Ready(match message { FromTaskMessage::NodeEvent(event) => Event::NodeEvent { task: match self.tasks.entry(task_id) { Entry::Occupied(inner) => TaskEntry { inner }, Entry::Vacant(_) => panic!("poll_inner only returns valid TaskIds; QED") }, event }, FromTaskMessage::NodeReached(conn_info) => Event::NodeReached { task: match self.tasks.entry(task_id) { Entry::Occupied(inner) => TaskEntry { inner }, Entry::Vacant(_) => panic!("poll_inner only returns valid TaskIds; QED") }, conn_info }, FromTaskMessage::TaskClosed(result, handler) => { let entry = self.tasks.remove(&task_id) .expect("poll_inner only returns valid TaskIds; QED"); Event::TaskClosed { task: ClosedTask::new(task_id, entry.sender, entry.user_data), result, handler } } }) } } /// Access to a task in the collection. pub struct TaskEntry<'a, E, T> { inner: OccupiedEntry<'a, TaskId, TaskInfo<E, T>> } impl<'a, E, T> TaskEntry<'a, E, T> { /// Begin sending an event to the given node. Must be called only after a successful call to /// `poll_ready_event`. pub fn start_send_event(&mut self, event: E) { let msg = ToTaskMessage::HandlerEvent(event); self.start_send_event_msg(msg); } /// Make sure we are ready to accept an event to be sent with `start_send_event`. pub fn poll_ready_event(&mut self, cx: &mut Context) -> Poll<()> { self.poll_ready_event_msg(cx) } /// Returns the user data associated with the task. pub fn user_data(&self) -> &T { &self.inner.get().user_data } /// Returns the user data associated with the task. pub fn user_data_mut(&mut self) -> &mut T { &mut self.inner.get_mut().user_data } /// Returns the task id. pub fn id(&self) -> TaskId { *self.inner.key() } /// Closes the task. Returns the user data. /// /// No further event will be generated for this task, but the connection inside the task will /// continue to run until the `ClosedTask` is destroyed. pub fn close(self) -> ClosedTask<E, T> { let id = *self.inner.key(); let task = self.inner.remove(); ClosedTask::new(id, task.sender, task.user_data) } /// Gives ownership of a closed task. /// As soon as our task (`self`) has some acknowledgment from the remote /// that its connection is alive, it will close the connection with `other`. /// /// Must be called only after a successful call to `poll_ready_take_over`. pub fn start_take_over(&mut self, t: ClosedTask<E, T>) { self.start_send_event_msg(ToTaskMessage::TakeOver(t.sender)); } /// Make sure we are ready to taking over with `start_take_over`. pub fn poll_ready_take_over(&mut self, cx: &mut Context) -> Poll<()> { self.poll_ready_event_msg(cx) } /// Sends a message to the task. Must be called only after a successful call to /// `poll_ready_event`. /// /// The API mimicks the one of [`futures::Sink`]. fn start_send_event_msg(&mut self, msg: ToTaskMessage<E>) { // It is possible that the sender is closed if the background task has already finished // but the local state hasn't been updated yet because we haven't been polled in the // meanwhile. match self.inner.get_mut().sender.start_send(msg) { Ok(()) => {}, Err(ref err) if err.is_full() => {}, // TODO: somehow report to user? Err(_) => {}, } } /// Wait until we have space to send an event using `start_send_event_msg`. fn poll_ready_event_msg(&mut self, cx: &mut Context) -> Poll<()> { // It is possible that the sender is closed if the background task has already finished // but the local state hasn't been updated yet because we haven't been polled in the // meanwhile. let task = self.inner.get_mut(); task.sender.poll_ready(cx).map(|_| ()) } } impl<E, T: fmt::Debug> fmt::Debug for TaskEntry<'_, E, T> { fn fmt(&self, f: &mut fmt::Formatter) -> fmt::Result { f.debug_tuple("TaskEntry") .field(&self.id()) .field(self.user_data()) .finish() } } /// Task after it has been closed. /// /// The connection to the remote is potentially still going on, but no new /// event for this task will be received. pub struct ClosedTask<E, T> { /// Identifier of the task that closed. /// /// No longer corresponds to anything, but can be reported to the user. id: TaskId, /// The channel to the task. /// /// The task will continue to work for as long as this channel is alive, /// but events produced by it are ignored. sender: mpsc::Sender<ToTaskMessage<E>>, /// The data provided by the user. user_data: T } impl<E, T> ClosedTask<E, T> { /// Create a new `ClosedTask` value. fn new(id: TaskId, sender: mpsc::Sender<ToTaskMessage<E>>, user_data: T) -> Self { Self { id, sender, user_data } } /// Returns the task id. /// /// Note that this task is no longer managed and therefore calling /// `Manager::task()` with this ID will fail. pub fn id(&self) -> TaskId { self.id } /// Returns the user data associated with the task. pub fn user_data(&self) -> &T { &self.user_data } /// Returns the user data associated with the task. pub fn user_data_mut(&mut self) -> &mut T { &mut self.user_data } /// Finish destroying the task and yield the user data. /// This closes the connection to the remote. pub fn into_user_data(self) -> T { self.user_data } } impl<E, T: fmt::Debug> fmt::Debug for ClosedTask<E, T> { fn fmt(&self, f: &mut fmt::Formatter) -> fmt::Result { f.debug_tuple("ClosedTask") .field(&self.id) .field(&self.user_data) .finish() } }