Skip to content

HTTPS clone URL

Subversion checkout URL

You can clone with HTTPS or Subversion.

Download ZIP
Fetching contributors…

Cannot retrieve contributors at this time

108 lines (90 sloc) 2.438 kb
// 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.
// xfail-win32
extern mod extra;
use extra::list::{List, Cons, Nil};
use extra::time::precise_time_s;
use std::os;
use std::task;
enum UniqueList {
ULNil, ULCons(~UniqueList)
}
fn main() {
let (repeat, depth) = if os::getenv(~"RUST_BENCH").is_some() {
(50, 1000)
} else {
(10, 10)
};
run(repeat, depth);
}
fn run(repeat: int, depth: int) {
for (repeat as uint).times {
debug!("starting %.4f", precise_time_s());
do task::try {
recurse_or_fail(depth, None)
};
debug!("stopping %.4f", precise_time_s());
}
}
type nillist = List<()>;
// Filled with things that have to be unwound
struct State {
box: @nillist,
unique: ~nillist,
fn_box: @fn() -> @nillist,
tuple: (@nillist, ~nillist),
vec: ~[@nillist],
res: r
}
struct r {
_l: @nillist,
}
#[unsafe_destructor]
impl Drop for r {
fn drop(&self) {}
}
fn r(l: @nillist) -> r {
r {
_l: l
}
}
fn recurse_or_fail(depth: int, st: Option<State>) {
if depth == 0 {
debug!("unwinding %.4f", precise_time_s());
fail!();
} else {
let depth = depth - 1;
let st = match st {
None => {
State {
box: @Nil,
unique: ~Nil,
fn_box: || @Nil::<()>,
tuple: (@Nil, ~Nil),
vec: ~[@Nil],
res: r(@Nil)
}
}
Some(st) => {
let fn_box = st.fn_box;
State {
box: @Cons((), st.box),
unique: ~Cons((), @*st.unique),
fn_box: || @Cons((), fn_box()),
tuple: (@Cons((), st.tuple.first()),
~Cons((), @*st.tuple.second())),
vec: st.vec + [@Cons((), *st.vec.last())],
res: r(@Cons((), st.res._l))
}
}
};
recurse_or_fail(depth, Some(st));
}
}
Jump to Line
Something went wrong with that request. Please try again.