2573fe7026
This replaces the make-based test runner with a set of Rust-based test runners. I believe that all existing functionality has been preserved. The primary objective is to dogfood the Rust test framework. A few main things happen here: 1) The run-pass/lib-* tests are all moved into src/test/stdtest. This is a standalone test crate intended for all standard library tests. It compiles to build/test/stdtest.stageN. 2) rustc now compiles into yet another build artifact, this one a test runner that runs any tests contained directly in the rustc crate. This allows much more fine-grained unit testing of the compiler. It compiles to build/test/rustctest.stageN. 3) There is a new custom test runner crate at src/test/compiletest that reproduces all the functionality for running the compile-fail, run-fail, run-pass and bench tests while integrating with Rust's test framework. It compiles to build/test/compiletest.stageN. 4) The build rules have been completely changed to use the new test runners, while also being less redundant, following the example of the recent stageN.mk rewrite. It adds two new features to the cfail/rfail/rpass/bench tests: 1) Tests can specify multiple 'error-pattern' directives which must be satisfied in order. 2) Tests can specify a 'compile-flags' directive which will make the test runner provide additional command line arguments to rustc. There are some downsides, the primary being that Rust has to be functioning pretty well just to run _any_ tests, which I imagine will be the source of some frustration when the entire test suite breaks. Will also cause some headaches during porting. Not having individual make rules, each rpass, etc test no longer remembers between runs whether it completed successfully. As a result, it's not possible to incrementally fix multiple tests by just running 'make check', fixing a test, and repeating without re-running all the tests contained in the test runner. Instead you can filter just the tests you want to run by using the TESTNAME environment variable. This also dispenses with the ability to run stage0 tests, but they tended to be broken more often than not anyway.
53 lines
1.6 KiB
Rust
53 lines
1.6 KiB
Rust
|
|
use std;
|
|
import std::int;
|
|
|
|
tag tree { nil; node(@tree, @tree, int); }
|
|
|
|
fn item_check(@tree t) -> int {
|
|
alt (*t) {
|
|
case (nil) { ret 0; }
|
|
case (node(?left, ?right, ?item)) {
|
|
ret item + item_check(left) - item_check(right);
|
|
}
|
|
}
|
|
}
|
|
|
|
fn bottom_up_tree(int item, int depth) -> @tree {
|
|
if (depth > 0) {
|
|
ret @node(bottom_up_tree(2 * item - 1, depth - 1),
|
|
bottom_up_tree(2 * item, depth - 1), item);
|
|
} else { ret @nil; }
|
|
}
|
|
|
|
fn main() {
|
|
auto n = 8;
|
|
auto min_depth = 4;
|
|
auto max_depth;
|
|
if (min_depth + 2 > n) {
|
|
max_depth = min_depth + 2;
|
|
} else { max_depth = n; }
|
|
auto stretch_depth = max_depth + 1;
|
|
auto stretch_tree = bottom_up_tree(0, stretch_depth);
|
|
log #fmt("stretch tree of depth %d\t check: %d", stretch_depth,
|
|
item_check(stretch_tree));
|
|
auto long_lived_tree = bottom_up_tree(0, max_depth);
|
|
auto depth = min_depth;
|
|
while (depth <= max_depth) {
|
|
auto iterations = int::pow(2, max_depth - depth + min_depth as uint);
|
|
auto chk = 0;
|
|
auto i = 1;
|
|
while (i <= iterations) {
|
|
auto temp_tree = bottom_up_tree(i, depth);
|
|
chk += item_check(temp_tree);
|
|
temp_tree = bottom_up_tree(-i, depth);
|
|
chk += item_check(temp_tree);
|
|
i += 1;
|
|
}
|
|
log #fmt("%d\t trees of depth %d\t check: %d", iterations * 2, depth,
|
|
chk);
|
|
depth += 2;
|
|
}
|
|
log #fmt("long lived trees of depth %d\t check: %d", max_depth,
|
|
item_check(long_lived_tree));
|
|
} |