1 // Copyright 2013 The Rust Project Developers. See the COPYRIGHT
2 // file at the top-level directory of this distribution and at
3 // http://rust-lang.org/COPYRIGHT.
5 // Licensed under the Apache License, Version 2.0 <LICENSE-APACHE or
6 // http://www.apache.org/licenses/LICENSE-2.0> or the MIT license
7 // <LICENSE-MIT or http://opensource.org/licenses/MIT>, at your
8 // option. This file may not be copied, modified, or distributed
9 // except according to those terms.
11 //! Ports and channels.
16 use rt::kill::BlockedTask;
18 use rt::sched::Scheduler;
20 use rt::select::{Select, SelectPort};
21 use unstable::atomics::{AtomicUint, AtomicOption, Acquire, Relaxed, SeqCst};
22 use unstable::sync::UnsafeAtomicRcBox;
24 use comm::{GenericChan, GenericSmartChan, GenericPort, Peekable};
27 use rt::{context, SchedulerContext};
28 use tuple::ImmutableTuple;
30 /// A combined refcount / BlockedTask-as-uint pointer.
32 /// Can be equal to the following values:
34 /// * 2 - both endpoints are alive
35 /// * 1 - either the sender or the receiver is dead, determined by context
36 /// * <ptr> - A pointer to a blocked Task (see BlockedTask::cast_{to,from}_uint)
39 static STATE_BOTH: State = 2;
40 static STATE_ONE: State = 1;
42 /// The heap-allocated structure shared between two endpoints.
48 /// A one-shot channel.
49 pub struct ChanOne<T> {
50 void_packet: *mut Void,
51 suppress_finalize: bool
55 pub struct PortOne<T> {
56 void_packet: *mut Void,
57 suppress_finalize: bool
60 pub fn oneshot<T: Send>() -> (PortOne<T>, ChanOne<T>) {
61 let packet: ~Packet<T> = ~Packet {
62 state: AtomicUint::new(STATE_BOTH),
67 let packet: *mut Void = cast::transmute(packet);
70 suppress_finalize: false
74 suppress_finalize: false
82 fn packet(&self) -> *mut Packet<T> {
84 let p: *mut ~Packet<T> = cast::transmute(&self.void_packet);
85 let p: *mut Packet<T> = &mut **p;
90 /// Send a message on the one-shot channel. If a receiver task is blocked
91 /// waiting for the message, will wake it up and reschedule to it.
92 pub fn send(self, val: T) {
96 /// As `send`, but also returns whether or not the receiver endpoint is still open.
97 pub fn try_send(self, val: T) -> bool {
98 self.try_send_inner(val, true)
101 /// Send a message without immediately rescheduling to a blocked receiver.
102 /// This can be useful in contexts where rescheduling is forbidden, or to
103 /// optimize for when the sender expects to still have useful work to do.
104 pub fn send_deferred(self, val: T) {
105 self.try_send_deferred(val);
108 /// As `send_deferred` and `try_send` together.
109 pub fn try_send_deferred(self, val: T) -> bool {
110 self.try_send_inner(val, false)
113 // 'do_resched' configures whether the scheduler immediately switches to
114 // the receiving task, or leaves the sending task still running.
115 fn try_send_inner(self, val: T, do_resched: bool) -> bool {
116 rtassert!(context() != SchedulerContext);
119 let mut recvr_active = true;
120 let packet = this.packet();
124 // Install the payload
125 assert!((*packet).payload.is_none());
126 (*packet).payload = Some(val);
128 // Atomically swap out the old state to figure out what
129 // the port's up to, issuing a release barrier to prevent
130 // reordering of the payload write. This also issues an
131 // acquire barrier that keeps the subsequent access of the
132 // ~Task pointer from being reordered.
133 let oldstate = (*packet).state.swap(STATE_ONE, SeqCst);
135 // Suppress the synchronizing actions in the finalizer. We're
136 // done with the packet. NB: In case of do_resched, this *must*
137 // happen before waking up a blocked task (or be unkillable),
138 // because we might get a kill signal during the reschedule.
139 this.suppress_finalize = true;
143 // Port is not waiting yet. Nothing to do
144 do Local::borrow::<Scheduler, ()> |sched| {
145 rtdebug!("non-rendezvous send");
146 sched.metrics.non_rendezvous_sends += 1;
150 do Local::borrow::<Scheduler, ()> |sched| {
151 rtdebug!("rendezvous send");
152 sched.metrics.rendezvous_sends += 1;
154 // Port has closed. Need to clean up.
155 let _packet: ~Packet<T> = cast::transmute(this.void_packet);
156 recvr_active = false;
159 // Port is blocked. Wake it up.
160 let recvr = BlockedTask::cast_from_uint(task_as_state);
162 do recvr.wake().map_move |woken_task| {
163 Scheduler::run_task(woken_task);
166 let recvr = Cell::new(recvr);
167 do Local::borrow::<Scheduler, ()> |sched| {
168 sched.enqueue_blocked_task(recvr.take());
180 fn packet(&self) -> *mut Packet<T> {
182 let p: *mut ~Packet<T> = cast::transmute(&self.void_packet);
183 let p: *mut Packet<T> = &mut **p;
188 /// Wait for a message on the one-shot port. Fails if the send end is closed.
189 pub fn recv(self) -> T {
190 match self.try_recv() {
193 fail!("receiving on closed channel");
198 /// As `recv`, but returns `None` if the send end is closed rather than failing.
199 pub fn try_recv(self) -> Option<T> {
202 // Optimistic check. If data was sent already, we don't even need to block.
203 // No release barrier needed here; we're not handing off our task pointer yet.
204 if !this.optimistic_check() {
205 // No data available yet.
206 // Switch to the scheduler to put the ~Task into the Packet state.
207 let sched = Local::take::<Scheduler>();
208 do sched.deschedule_running_task_and_then |sched, task| {
209 this.block_on(sched, task);
218 impl<T> Select for PortOne<T> {
219 #[inline] #[cfg(not(test))]
220 fn optimistic_check(&mut self) -> bool {
221 unsafe { (*self.packet()).state.load(Acquire) == STATE_ONE }
224 #[inline] #[cfg(test)]
225 fn optimistic_check(&mut self) -> bool {
226 // The optimistic check is never necessary for correctness. For testing
227 // purposes, making it randomly return false simulates a racing sender.
228 use rand::{Rand, rng};
230 let actually_check = Rand::rand(&mut rng);
232 unsafe { (*self.packet()).state.load(Acquire) == STATE_ONE }
238 fn block_on(&mut self, sched: &mut Scheduler, task: BlockedTask) -> bool {
240 // Atomically swap the task pointer into the Packet state, issuing
241 // an acquire barrier to prevent reordering of the subsequent read
242 // of the payload. Also issues a release barrier to prevent
243 // reordering of any previous writes to the task structure.
244 let task_as_state = task.cast_to_uint();
245 let oldstate = (*self.packet()).state.swap(task_as_state, SeqCst);
248 // Data has not been sent. Now we're blocked.
249 rtdebug!("non-rendezvous recv");
250 sched.metrics.non_rendezvous_recvs += 1;
254 // Re-record that we are the only owner of the packet.
255 // No barrier needed, even if the task gets reawoken
256 // on a different core -- this is analogous to writing a
257 // payload; a barrier in enqueueing the task protects it.
258 // NB(#8132). This *must* occur before the enqueue below.
259 // FIXME(#6842, #8130) This is usually only needed for the
260 // assertion in recv_ready, except in the case of select().
261 // This won't actually ever have cacheline contention, but
262 // maybe should be optimized out with a cfg(test) anyway?
263 (*self.packet()).state.store(STATE_ONE, Relaxed);
265 rtdebug!("rendezvous recv");
266 sched.metrics.rendezvous_recvs += 1;
268 // Channel is closed. Switch back and check the data.
269 // NB: We have to drop back into the scheduler event loop here
270 // instead of switching immediately back or we could end up
271 // triggering infinite recursion on the scheduler's stack.
272 let recvr = BlockedTask::cast_from_uint(task_as_state);
273 sched.enqueue_blocked_task(recvr);
276 _ => rtabort!("can't block_on; a task is already blocked")
281 // This is the only select trait function that's not also used in recv.
282 fn unblock_from(&mut self) -> bool {
283 let packet = self.packet();
285 // In case the data is available, the acquire barrier here matches
286 // the release barrier the sender used to release the payload.
287 match (*packet).state.load(Acquire) {
288 // Impossible. We removed STATE_BOTH when blocking on it, and
289 // no self-respecting sender would put it back.
290 STATE_BOTH => rtabort!("refcount already 2 in unblock_from"),
291 // Here, a sender already tried to wake us up. Perhaps they
292 // even succeeded! Data is available.
294 // Still registered as blocked. Need to "unblock" the pointer.
296 // In the window between the load and the CAS, a sender
297 // might take the pointer and set the refcount to ONE. If
298 // that happens, we shouldn't clobber that with BOTH!
299 // Acquire barrier again for the same reason as above.
300 match (*packet).state.compare_and_swap(task_as_state, STATE_BOTH,
302 STATE_BOTH => rtabort!("refcount became 2 in unblock_from"),
303 STATE_ONE => true, // Lost the race. Data available.
305 // We successfully unblocked our task pointer.
306 assert!(task_as_state == same_ptr);
307 let handle = BlockedTask::cast_from_uint(task_as_state);
308 // Because we are already awake, the handle we
309 // gave to this port shall already be empty.
310 handle.assert_already_awake();
320 impl<T> SelectPort<T> for PortOne<T> {
321 fn recv_ready(self) -> Option<T> {
323 let packet = this.packet();
325 // No further memory barrier is needed here to access the
326 // payload. Some scenarios:
328 // 1) We encountered STATE_ONE above - the atomic_xchg was the acq barrier. We're fine.
329 // 2) We encountered STATE_BOTH above and blocked. The sending task then ran us
330 // and ran on its thread. The sending task issued a read barrier when taking the
331 // pointer to the receiving task.
332 // 3) We encountered STATE_BOTH above and blocked, but the receiving task (this task)
333 // is pinned to some other scheduler, so the sending task had to give us to
334 // a different scheduler for resuming. That send synchronized memory.
336 // See corresponding store() above in block_on for rationale.
337 // FIXME(#8130) This can happen only in test builds.
338 assert!((*packet).state.load(Relaxed) == STATE_ONE);
340 let payload = (*packet).payload.take();
342 // The sender has closed up shop. Drop the packet.
343 let _packet: ~Packet<T> = cast::transmute(this.void_packet);
344 // Suppress the synchronizing actions in the finalizer. We're done with the packet.
345 this.suppress_finalize = true;
351 impl<T> Peekable<T> for PortOne<T> {
352 fn peek(&self) -> bool {
354 let packet: *mut Packet<T> = self.packet();
355 let oldstate = (*packet).state.load(SeqCst);
358 STATE_ONE => (*packet).payload.is_some(),
359 _ => rtabort!("peeked on a blocked task")
366 impl<T> Drop for ChanOne<T> {
368 if self.suppress_finalize { return }
371 let this = cast::transmute_mut(self);
372 let oldstate = (*this.packet()).state.swap(STATE_ONE, SeqCst);
375 // Port still active. It will destroy the Packet.
378 let _packet: ~Packet<T> = cast::transmute(this.void_packet);
381 // The port is blocked waiting for a message we will never send. Wake it.
382 assert!((*this.packet()).payload.is_none());
383 let recvr = BlockedTask::cast_from_uint(task_as_state);
384 do recvr.wake().map_move |woken_task| {
385 Scheduler::run_task(woken_task);
394 impl<T> Drop for PortOne<T> {
396 if self.suppress_finalize { return }
399 let this = cast::transmute_mut(self);
400 let oldstate = (*this.packet()).state.swap(STATE_ONE, SeqCst);
403 // Chan still active. It will destroy the packet.
406 let _packet: ~Packet<T> = cast::transmute(this.void_packet);
409 // This case occurs during unwinding, when the blocked
410 // receiver was killed awake. The task can't still be
411 // blocked (we are it), but we need to free the handle.
412 let recvr = BlockedTask::cast_from_uint(task_as_state);
413 recvr.assert_already_awake();
420 /// Trait for non-rescheduling send operations, similar to `send_deferred` on ChanOne.
421 pub trait SendDeferred<T> {
422 fn send_deferred(&self, val: T);
423 fn try_send_deferred(&self, val: T) -> bool;
426 struct StreamPayload<T> {
428 next: PortOne<StreamPayload<T>>
431 type StreamChanOne<T> = ChanOne<StreamPayload<T>>;
432 type StreamPortOne<T> = PortOne<StreamPayload<T>>;
434 /// A channel with unbounded size.
436 // FIXME #5372. Using Cell because we don't take &mut self
437 next: Cell<StreamChanOne<T>>
440 /// An port with unbounded size.
442 // FIXME #5372. Using Cell because we don't take &mut self
443 next: Cell<StreamPortOne<T>>
446 pub fn stream<T: Send>() -> (Port<T>, Chan<T>) {
447 let (pone, cone) = oneshot();
448 let port = Port { next: Cell::new(pone) };
449 let chan = Chan { next: Cell::new(cone) };
453 impl<T: Send> Chan<T> {
454 fn try_send_inner(&self, val: T, do_resched: bool) -> bool {
455 let (next_pone, next_cone) = oneshot();
456 let cone = self.next.take();
457 self.next.put_back(next_cone);
458 cone.try_send_inner(StreamPayload { val: val, next: next_pone }, do_resched)
462 impl<T: Send> GenericChan<T> for Chan<T> {
463 fn send(&self, val: T) {
468 impl<T: Send> GenericSmartChan<T> for Chan<T> {
469 fn try_send(&self, val: T) -> bool {
470 self.try_send_inner(val, true)
474 impl<T: Send> SendDeferred<T> for Chan<T> {
475 fn send_deferred(&self, val: T) {
476 self.try_send_deferred(val);
478 fn try_send_deferred(&self, val: T) -> bool {
479 self.try_send_inner(val, false)
483 impl<T> GenericPort<T> for Port<T> {
484 fn recv(&self) -> T {
485 match self.try_recv() {
488 fail!("receiving on closed channel");
493 fn try_recv(&self) -> Option<T> {
494 let pone = self.next.take();
495 match pone.try_recv() {
496 Some(StreamPayload { val, next }) => {
497 self.next.put_back(next);
505 impl<T> Peekable<T> for Port<T> {
506 fn peek(&self) -> bool {
507 self.next.with_mut_ref(|p| p.peek())
511 // XXX: Kind of gross. A Port<T> should be selectable so you can make an array
512 // of them, but a &Port<T> should also be selectable so you can select2 on it
513 // alongside a PortOne<U> without passing the port by value in recv_ready.
515 impl<'self, T> Select for &'self Port<T> {
517 fn optimistic_check(&mut self) -> bool {
518 do self.next.with_mut_ref |pone| { pone.optimistic_check() }
522 fn block_on(&mut self, sched: &mut Scheduler, task: BlockedTask) -> bool {
523 let task = Cell::new(task);
524 do self.next.with_mut_ref |pone| { pone.block_on(sched, task.take()) }
528 fn unblock_from(&mut self) -> bool {
529 do self.next.with_mut_ref |pone| { pone.unblock_from() }
533 impl<T> Select for Port<T> {
535 fn optimistic_check(&mut self) -> bool {
536 (&*self).optimistic_check()
540 fn block_on(&mut self, sched: &mut Scheduler, task: BlockedTask) -> bool {
541 (&*self).block_on(sched, task)
545 fn unblock_from(&mut self) -> bool {
546 (&*self).unblock_from()
550 impl<'self, T> SelectPort<T> for &'self Port<T> {
551 fn recv_ready(self) -> Option<T> {
552 match self.next.take().recv_ready() {
553 Some(StreamPayload { val, next }) => {
554 self.next.put_back(next);
562 pub struct SharedChan<T> {
563 // Just like Chan, but a shared AtomicOption instead of Cell
564 priv next: UnsafeAtomicRcBox<AtomicOption<StreamChanOne<T>>>
567 impl<T> SharedChan<T> {
568 pub fn new(chan: Chan<T>) -> SharedChan<T> {
569 let next = chan.next.take();
570 let next = AtomicOption::new(~next);
571 SharedChan { next: UnsafeAtomicRcBox::new(next) }
575 impl<T: Send> SharedChan<T> {
576 fn try_send_inner(&self, val: T, do_resched: bool) -> bool {
578 let (next_pone, next_cone) = oneshot();
579 let cone = (*self.next.get()).swap(~next_cone, SeqCst);
580 cone.unwrap().try_send_inner(StreamPayload { val: val, next: next_pone },
586 impl<T: Send> GenericChan<T> for SharedChan<T> {
587 fn send(&self, val: T) {
592 impl<T: Send> GenericSmartChan<T> for SharedChan<T> {
593 fn try_send(&self, val: T) -> bool {
594 self.try_send_inner(val, true)
598 impl<T: Send> SendDeferred<T> for SharedChan<T> {
599 fn send_deferred(&self, val: T) {
600 self.try_send_deferred(val);
602 fn try_send_deferred(&self, val: T) -> bool {
603 self.try_send_inner(val, false)
607 impl<T> Clone for SharedChan<T> {
608 fn clone(&self) -> SharedChan<T> {
610 next: self.next.clone()
615 pub struct SharedPort<T> {
616 // The next port on which we will receive the next port on which we will receive T
617 priv next_link: UnsafeAtomicRcBox<AtomicOption<PortOne<StreamPortOne<T>>>>
620 impl<T> SharedPort<T> {
621 pub fn new(port: Port<T>) -> SharedPort<T> {
622 // Put the data port into a new link pipe
623 let next_data_port = port.next.take();
624 let (next_link_port, next_link_chan) = oneshot();
625 next_link_chan.send(next_data_port);
626 let next_link = AtomicOption::new(~next_link_port);
627 SharedPort { next_link: UnsafeAtomicRcBox::new(next_link) }
631 impl<T: Send> GenericPort<T> for SharedPort<T> {
632 fn recv(&self) -> T {
633 match self.try_recv() {
636 fail!("receiving on a closed channel");
641 fn try_recv(&self) -> Option<T> {
643 let (next_link_port, next_link_chan) = oneshot();
644 let link_port = (*self.next_link.get()).swap(~next_link_port, SeqCst);
645 let link_port = link_port.unwrap();
646 let data_port = link_port.recv();
647 let (next_data_port, res) = match data_port.try_recv() {
648 Some(StreamPayload { val, next }) => {
652 let (next_data_port, _) = oneshot();
653 (next_data_port, None)
656 next_link_chan.send(next_data_port);
662 impl<T> Clone for SharedPort<T> {
663 fn clone(&self) -> SharedPort<T> {
665 next_link: self.next_link.clone()
670 // XXX: Need better name
671 type MegaPipe<T> = (SharedPort<T>, SharedChan<T>);
673 pub fn megapipe<T: Send>() -> MegaPipe<T> {
674 let (port, chan) = stream();
675 (SharedPort::new(port), SharedChan::new(chan))
678 impl<T: Send> GenericChan<T> for MegaPipe<T> {
679 fn send(&self, val: T) {
680 self.second_ref().send(val)
684 impl<T: Send> GenericSmartChan<T> for MegaPipe<T> {
685 fn try_send(&self, val: T) -> bool {
686 self.second_ref().try_send(val)
690 impl<T: Send> GenericPort<T> for MegaPipe<T> {
691 fn recv(&self) -> T {
692 self.first_ref().recv()
695 fn try_recv(&self) -> Option<T> {
696 self.first_ref().try_recv()
700 impl<T: Send> SendDeferred<T> for MegaPipe<T> {
701 fn send_deferred(&self, val: T) {
702 self.second_ref().send_deferred(val)
704 fn try_send_deferred(&self, val: T) -> bool {
705 self.second_ref().try_send_deferred(val)
718 fn oneshot_single_thread_close_port_first() {
719 // Simple test of closing without sending
720 do run_in_newsched_task {
721 let (port, _chan) = oneshot::<int>();
727 fn oneshot_single_thread_close_chan_first() {
728 // Simple test of closing without sending
729 do run_in_newsched_task {
730 let (_port, chan) = oneshot::<int>();
736 fn oneshot_single_thread_send_port_close() {
737 // Testing that the sender cleans up the payload if receiver is closed
738 do run_in_newsched_task {
739 let (port, chan) = oneshot::<~int>();
746 fn oneshot_single_thread_recv_chan_close() {
747 // Receiving on a closed chan will fail
748 do run_in_newsched_task {
749 let res = do spawntask_try {
750 let (port, chan) = oneshot::<~int>();
755 rtdebug!("res is: %?", res.is_err());
756 assert!(res.is_err());
761 fn oneshot_single_thread_send_then_recv() {
762 do run_in_newsched_task {
763 let (port, chan) = oneshot::<~int>();
765 assert!(port.recv() == ~10);
770 fn oneshot_single_thread_try_send_open() {
771 do run_in_newsched_task {
772 let (port, chan) = oneshot::<int>();
773 assert!(chan.try_send(10));
774 assert!(port.recv() == 10);
779 fn oneshot_single_thread_try_send_closed() {
780 do run_in_newsched_task {
781 let (port, chan) = oneshot::<int>();
783 assert!(!chan.try_send(10));
788 fn oneshot_single_thread_try_recv_open() {
789 do run_in_newsched_task {
790 let (port, chan) = oneshot::<int>();
792 assert!(port.try_recv() == Some(10));
797 fn oneshot_single_thread_try_recv_closed() {
798 do run_in_newsched_task {
799 let (port, chan) = oneshot::<int>();
801 assert!(port.try_recv() == None);
806 fn oneshot_single_thread_peek_data() {
807 do run_in_newsched_task {
808 let (port, chan) = oneshot::<int>();
809 assert!(!port.peek());
811 assert!(port.peek());
816 fn oneshot_single_thread_peek_close() {
817 do run_in_newsched_task {
818 let (port, chan) = oneshot::<int>();
820 assert!(!port.peek());
821 assert!(!port.peek());
826 fn oneshot_single_thread_peek_open() {
827 do run_in_newsched_task {
828 let (port, _) = oneshot::<int>();
829 assert!(!port.peek());
834 fn oneshot_multi_task_recv_then_send() {
835 do run_in_newsched_task {
836 let (port, chan) = oneshot::<~int>();
837 let port_cell = Cell::new(port);
839 assert!(port_cell.take().recv() == ~10);
847 fn oneshot_multi_task_recv_then_close() {
848 do run_in_newsched_task {
849 let (port, chan) = oneshot::<~int>();
850 let port_cell = Cell::new(port);
851 let chan_cell = Cell::new(chan);
853 let _cell = chan_cell.take();
855 let res = do spawntask_try {
856 assert!(port_cell.take().recv() == ~10);
858 assert!(res.is_err());
863 fn oneshot_multi_thread_close_stress() {
864 do stress_factor().times {
865 do run_in_newsched_task {
866 let (port, chan) = oneshot::<int>();
867 let port_cell = Cell::new(port);
868 let thread = do spawntask_thread {
869 let _p = port_cell.take();
878 fn oneshot_multi_thread_send_close_stress() {
879 do stress_factor().times {
880 do run_in_newsched_task {
881 let (port, chan) = oneshot::<int>();
882 let chan_cell = Cell::new(chan);
883 let port_cell = Cell::new(port);
884 let thread1 = do spawntask_thread {
885 let _p = port_cell.take();
887 let thread2 = do spawntask_thread {
888 let c = chan_cell.take();
898 fn oneshot_multi_thread_recv_close_stress() {
899 do stress_factor().times {
900 do run_in_newsched_task {
901 let (port, chan) = oneshot::<int>();
902 let chan_cell = Cell::new(chan);
903 let port_cell = Cell::new(port);
904 let thread1 = do spawntask_thread {
905 let port_cell = Cell::new(port_cell.take());
906 let res = do spawntask_try {
907 port_cell.take().recv();
909 assert!(res.is_err());
911 let thread2 = do spawntask_thread {
912 let chan_cell = Cell::new(chan_cell.take());
924 fn oneshot_multi_thread_send_recv_stress() {
925 do stress_factor().times {
926 do run_in_newsched_task {
927 let (port, chan) = oneshot::<~int>();
928 let chan_cell = Cell::new(chan);
929 let port_cell = Cell::new(port);
930 let thread1 = do spawntask_thread {
931 chan_cell.take().send(~10);
933 let thread2 = do spawntask_thread {
934 assert!(port_cell.take().recv() == ~10);
943 fn stream_send_recv_stress() {
944 do stress_factor().times {
945 do run_in_mt_newsched_task {
946 let (port, chan) = stream::<~int>();
951 fn send(chan: Chan<~int>, i: int) {
952 if i == 10 { return }
954 let chan_cell = Cell::new(chan);
955 do spawntask_random {
956 let chan = chan_cell.take();
962 fn recv(port: Port<~int>, i: int) {
963 if i == 10 { return }
965 let port_cell = Cell::new(port);
966 do spawntask_random {
967 let port = port_cell.take();
968 assert!(port.recv() == ~i);
978 // Regression test that we don't run out of stack in scheduler context
979 do run_in_newsched_task {
980 let (port, chan) = stream();
981 do 10000.times { chan.send(()) }
982 do 10000.times { port.recv() }
987 fn shared_chan_stress() {
988 do run_in_mt_newsched_task {
989 let (port, chan) = stream();
990 let chan = SharedChan::new(chan);
991 let total = stress_factor() + 100;
993 let chan_clone = chan.clone();
994 do spawntask_random {
1006 fn shared_port_stress() {
1007 do run_in_mt_newsched_task {
1008 // XXX: Removing these type annotations causes an ICE
1009 let (end_port, end_chan) = stream::<()>();
1010 let (port, chan) = stream::<()>();
1011 let end_chan = SharedChan::new(end_chan);
1012 let port = SharedPort::new(port);
1013 let total = stress_factor() + 100;
1015 let end_chan_clone = end_chan.clone();
1016 let port_clone = port.clone();
1017 do spawntask_random {
1019 end_chan_clone.send(());
1034 fn shared_port_close_simple() {
1035 do run_in_mt_newsched_task {
1036 let (port, chan) = stream::<()>();
1037 let port = SharedPort::new(port);
1038 { let _chan = chan; }
1039 assert!(port.try_recv().is_none());
1044 fn shared_port_close() {
1045 do run_in_mt_newsched_task {
1046 let (end_port, end_chan) = stream::<bool>();
1047 let (port, chan) = stream::<()>();
1048 let end_chan = SharedChan::new(end_chan);
1049 let port = SharedPort::new(port);
1050 let chan = SharedChan::new(chan);
1051 let send_total = 10;
1052 let recv_total = 20;
1053 do spawntask_random {
1054 do send_total.times {
1055 let chan_clone = chan.clone();
1056 do spawntask_random {
1057 chan_clone.send(());
1061 let end_chan_clone = end_chan.clone();
1062 do spawntask_random {
1063 do recv_total.times {
1064 let port_clone = port.clone();
1065 let end_chan_clone = end_chan_clone.clone();
1066 do spawntask_random {
1067 let recvd = port_clone.try_recv().is_some();
1068 end_chan_clone.send(recvd);
1074 do recv_total.times {
1075 recvd += if end_port.recv() { 1 } else { 0 };
1078 assert!(recvd == send_total);
1083 fn megapipe_stress() {
1087 do run_in_mt_newsched_task {
1088 let (end_port, end_chan) = stream::<()>();
1089 let end_chan = SharedChan::new(end_chan);
1090 let pipe = megapipe();
1091 let total = stress_factor() + 10;
1092 let mut rng = rand::rng();
1094 let msgs = rng.gen_uint_range(0, 10);
1095 let pipe_clone = pipe.clone();
1096 let end_chan_clone = end_chan.clone();
1097 do spawntask_random {
1099 pipe_clone.send(());
1106 end_chan_clone.send(());
1116 fn send_deferred() {
1117 use unstable::sync::atomically;
1119 // Tests no-rescheduling of send_deferred on all types of channels.
1120 do run_in_newsched_task {
1121 let (pone, cone) = oneshot();
1122 let (pstream, cstream) = stream();
1123 let (pshared, cshared) = stream();
1124 let cshared = SharedChan::new(cshared);
1125 let mp = megapipe();
1127 let pone = Cell::new(pone);
1128 do spawntask { pone.take().recv(); }
1129 let pstream = Cell::new(pstream);
1130 do spawntask { pstream.take().recv(); }
1131 let pshared = Cell::new(pshared);
1132 do spawntask { pshared.take().recv(); }
1133 let p_mp = Cell::new(mp.clone());
1134 do spawntask { p_mp.take().recv(); }
1136 let cs = Cell::new((cone, cstream, cshared, mp));
1139 let (cone, cstream, cshared, mp) = cs.take();
1140 cone.send_deferred(());
1141 cstream.send_deferred(());
1142 cshared.send_deferred(());
1143 mp.send_deferred(());