rust/src/test/bench/rt-messaging-ping-pong.rs

79 lines
2.1 KiB
Rust
Raw Normal View History

2014-02-05 16:33:10 -06:00
// Copyright 2014 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.
// 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.
use std::os;
use std::uint;
// This is a simple bench that creates M pairs of tasks. These
// tasks ping-pong back and forth over a pair of streams. This is a
// cannonical message-passing benchmark as it heavily strains message
// passing and almost nothing else.
fn ping_pong_bench(n: uint, m: uint) {
// Create pairs of tasks that pingpong back and forth.
fn run_pair(n: uint) {
// Create a stream A->B
let (atx, arx) = channel::<()>();
// Create a stream B->A
let (btx, brx) = channel::<()>();
2014-01-27 18:29:50 -05:00
spawn(proc() {
let (tx, rx) = (atx, brx);
for _ in range(0, n) {
tx.send(());
rx.recv();
}
2014-01-27 18:29:50 -05:00
});
2014-01-27 18:29:50 -05:00
spawn(proc() {
let (tx, rx) = (btx, arx);
for _ in range(0, n) {
rx.recv();
tx.send(());
}
2014-01-27 18:29:50 -05:00
});
}
for _ in range(0, m) {
run_pair(n)
}
}
fn main() {
let args = os::args();
let n = if args.len() == 3 {
from_str::<uint>(args[1]).unwrap()
} else {
10000
};
let m = if args.len() == 3 {
from_str::<uint>(args[2]).unwrap()
} else {
4
};
ping_pong_bench(n, m);
}