rust/src/test/bench/task-perf-alloc-unwind.rs

105 lines
2.3 KiB
Rust
Raw Normal View History

// 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.
2012-06-02 19:42:48 -05:00
// xfail-win32
extern mod std;
2012-06-02 19:42:48 -05:00
2012-09-05 14:32:05 -05:00
use std::list::{List, Cons, Nil};
use std::time::precise_time_s;
2012-06-02 19:42:48 -05:00
enum UniqueList {
ULNil, ULCons(~UniqueList)
}
2012-06-02 19:42:48 -05:00
fn main() {
let (repeat, depth) = if os::getenv(~"RUST_BENCH").is_some() {
2012-06-02 19:42:48 -05:00
(50, 1000)
} else {
(10, 10)
};
run(repeat, depth);
}
fn run(repeat: int, depth: int) {
for iter::repeat(repeat as uint) {
2012-08-22 19:24:52 -05:00
debug!("starting %.4f", precise_time_s());
do task::try {
2012-08-20 14:23:37 -05:00
recurse_or_fail(depth, None)
2012-06-02 19:42:48 -05:00
};
2012-08-22 19:24:52 -05:00
debug!("stopping %.4f", precise_time_s());
2012-06-02 19:42:48 -05:00
}
}
2012-09-04 16:12:14 -05:00
type nillist = List<()>;
2012-06-02 19:42:48 -05:00
// Filled with things that have to be unwound
2013-01-28 20:55:44 -06:00
struct State {
box: @nillist,
unique: ~nillist,
fn_box: @fn() -> @nillist,
2013-01-28 20:55:44 -06:00
tuple: (@nillist, ~nillist),
vec: ~[@nillist],
res: r
2012-06-02 19:42:48 -05:00
}
2012-08-15 20:46:55 -05:00
struct r {
2012-09-06 21:40:15 -05:00
_l: @nillist,
}
impl Drop for r {
fn finalize(&self) {}
2012-06-02 19:42:48 -05:00
}
2012-09-05 17:58:43 -05:00
fn r(l: @nillist) -> r {
r {
_l: l
}
}
2013-01-28 20:55:44 -06:00
fn recurse_or_fail(depth: int, st: Option<State>) {
2012-06-02 19:42:48 -05:00
if depth == 0 {
2012-08-22 19:24:52 -05:00
debug!("unwinding %.4f", precise_time_s());
fail!();
2012-06-02 19:42:48 -05:00
} else {
let depth = depth - 1;
2012-08-06 14:34:08 -05:00
let st = match st {
2012-08-20 14:23:37 -05:00
None => {
2013-01-28 20:55:44 -06:00
State {
2012-09-04 16:12:14 -05:00
box: @Nil,
unique: ~Nil,
fn_box: || @Nil::<()>,
2012-09-04 16:12:14 -05:00
tuple: (@Nil, ~Nil),
vec: ~[@Nil],
res: r(@Nil)
2013-01-28 20:55:44 -06:00
}
2012-06-02 19:42:48 -05:00
}
2012-08-20 14:23:37 -05:00
Some(st) => {
2012-06-02 19:42:48 -05:00
let fn_box = st.fn_box;
2013-01-28 20:55:44 -06:00
State {
2012-09-04 16:12:14 -05:00
box: @Cons((), st.box),
unique: ~Cons((), @*st.unique),
fn_box: || @Cons((), fn_box()),
2012-09-04 16:12:14 -05:00
tuple: (@Cons((), st.tuple.first()),
~Cons((), @*st.tuple.second())),
vec: st.vec + ~[@Cons((), st.vec.last())],
res: r(@Cons((), st.res._l))
2013-01-28 20:55:44 -06:00
}
2012-06-02 19:42:48 -05:00
}
};
2013-02-15 04:44:18 -06:00
recurse_or_fail(depth, Some(st));
2012-06-02 19:42:48 -05:00
}
}