34ee63e93b
Part of #3853
211 lines
4.9 KiB
Rust
211 lines
4.9 KiB
Rust
// Copyright 2012 The Rust Project Developers. See the COPYRIGHT
|
|
// file at the top-level directory of this distribution and at
|
|
// http://rust-lang.org/COPYRIGHT.
|
|
//
|
|
// Licensed under the Apache License, Version 2.0 <LICENSE-APACHE or
|
|
// http://www.apache.org/licenses/LICENSE-2.0> or the MIT license
|
|
// <LICENSE-MIT or http://opensource.org/licenses/MIT>, at your
|
|
// option. This file may not be copied, modified, or distributed
|
|
// except according to those terms.
|
|
|
|
// Compare bounded and unbounded protocol performance.
|
|
|
|
// xfail-pretty
|
|
|
|
extern mod extra;
|
|
|
|
use extra::time::precise_time_s;
|
|
use std::cell::Cell;
|
|
use std::io;
|
|
use std::os;
|
|
use std::pipes::*;
|
|
use std::task;
|
|
|
|
proto! pingpong (
|
|
ping: send {
|
|
ping -> pong
|
|
}
|
|
|
|
pong: recv {
|
|
pong -> ping
|
|
}
|
|
)
|
|
|
|
proto! pingpong_unbounded (
|
|
ping: send {
|
|
ping -> pong
|
|
}
|
|
|
|
pong: recv {
|
|
pong -> ping
|
|
}
|
|
|
|
you_will_never_catch_me: send {
|
|
never_ever_ever -> you_will_never_catch_me
|
|
}
|
|
)
|
|
|
|
// This stuff should go in libcore::pipes
|
|
macro_rules! move_it (
|
|
{ $x:expr } => { let t = *ptr::to_unsafe_ptr(&($x)); t }
|
|
)
|
|
|
|
macro_rules! follow (
|
|
{
|
|
$($message:path($($x: ident),+) -> $next:ident $e:expr)+
|
|
} => (
|
|
|m| match m {
|
|
$(Some($message($($x,)* next)) => {
|
|
let $next = next;
|
|
$e })+
|
|
_ => { fail!() }
|
|
}
|
|
);
|
|
|
|
{
|
|
$($message:path -> $next:ident $e:expr)+
|
|
} => (
|
|
|m| match m {
|
|
$(Some($message(next)) => {
|
|
let $next = next;
|
|
$e })+
|
|
_ => { fail!() }
|
|
}
|
|
)
|
|
)
|
|
|
|
|
|
/** Spawn a task to provide a service.
|
|
|
|
It takes an initialization function that produces a send and receive
|
|
endpoint. The send endpoint is returned to the caller and the receive
|
|
endpoint is passed to the new task.
|
|
|
|
*/
|
|
pub fn spawn_service<T:Owned,Tb:Owned>(
|
|
init: extern fn() -> (RecvPacketBuffered<T, Tb>,
|
|
SendPacketBuffered<T, Tb>),
|
|
service: ~fn(v: RecvPacketBuffered<T, Tb>))
|
|
-> SendPacketBuffered<T, Tb> {
|
|
let (server, client) = init();
|
|
|
|
// This is some nasty gymnastics required to safely move the pipe
|
|
// into a new task.
|
|
let server = Cell::new(server);
|
|
do task::spawn {
|
|
service(server.take());
|
|
}
|
|
|
|
client
|
|
}
|
|
|
|
/** Like `spawn_service_recv`, but for protocols that start in the
|
|
receive state.
|
|
|
|
*/
|
|
pub fn spawn_service_recv<T:Owned,Tb:Owned>(
|
|
init: extern fn() -> (SendPacketBuffered<T, Tb>,
|
|
RecvPacketBuffered<T, Tb>),
|
|
service: ~fn(v: SendPacketBuffered<T, Tb>))
|
|
-> RecvPacketBuffered<T, Tb> {
|
|
let (server, client) = init();
|
|
|
|
// This is some nasty gymnastics required to safely move the pipe
|
|
// into a new task.
|
|
let server = Cell::new(server);
|
|
do task::spawn {
|
|
service(server.take())
|
|
}
|
|
|
|
client
|
|
}
|
|
|
|
fn switch<T:Owned,Tb:Owned,U>(endp: std::pipes::RecvPacketBuffered<T, Tb>,
|
|
f: &fn(v: Option<T>) -> U)
|
|
-> U {
|
|
f(std::pipes::try_recv(endp))
|
|
}
|
|
|
|
// Here's the benchmark
|
|
|
|
fn bounded(count: uint) {
|
|
use pingpong::*;
|
|
|
|
let mut ch = do spawn_service(init) |ch| {
|
|
let mut count = count;
|
|
let mut ch = ch;
|
|
while count > 0 {
|
|
ch = switch(ch, follow! (
|
|
ping -> next { server::pong(next) }
|
|
));
|
|
|
|
count -= 1;
|
|
}
|
|
};
|
|
|
|
let mut count = count;
|
|
while count > 0 {
|
|
let ch_ = client::ping(ch);
|
|
|
|
ch = switch(ch_, follow! (
|
|
pong -> next { next }
|
|
));
|
|
|
|
count -= 1;
|
|
}
|
|
}
|
|
|
|
fn unbounded(count: uint) {
|
|
use pingpong_unbounded::*;
|
|
|
|
let mut ch = do spawn_service(init) |ch| {
|
|
let mut count = count;
|
|
let mut ch = ch;
|
|
while count > 0 {
|
|
ch = switch(ch, follow! (
|
|
ping -> next { server::pong(next) }
|
|
));
|
|
|
|
count -= 1;
|
|
}
|
|
};
|
|
|
|
let mut count = count;
|
|
while count > 0 {
|
|
let ch_ = client::ping(ch);
|
|
|
|
ch = switch(ch_, follow! (
|
|
pong -> next { next }
|
|
));
|
|
|
|
count -= 1;
|
|
}
|
|
}
|
|
|
|
fn timeit(f: &fn()) -> float {
|
|
let start = precise_time_s();
|
|
f();
|
|
let stop = precise_time_s();
|
|
stop - start
|
|
}
|
|
|
|
fn main() {
|
|
let count = if os::getenv(~"RUST_BENCH").is_some() {
|
|
250000
|
|
} else {
|
|
100
|
|
};
|
|
let bounded = do timeit { bounded(count) };
|
|
let unbounded = do timeit { unbounded(count) };
|
|
|
|
io::println(fmt!("count: %?\n", count));
|
|
io::println(fmt!("bounded: %? s\t(%? μs/message)",
|
|
bounded, bounded * 1000000. / (count as float)));
|
|
io::println(fmt!("unbounded: %? s\t(%? μs/message)",
|
|
unbounded, unbounded * 1000000. / (count as float)));
|
|
|
|
io::println(fmt!("\n\
|
|
bounded is %?%% faster",
|
|
(unbounded - bounded) / bounded * 100.));
|
|
}
|