run benchmarks in a relatively fast test mode, as part of run.bash/all.bash

R=rsc
DELTA=293  (224 added, 0 deleted, 69 changed)
OCL=32917
CL=32944

1 files changed, 4 insertions, 4 deletions

diff --git a/test/bench/binary-tree-freelist.go b/test/bench/binary-tree-freelist.go
index b1d3a3241..7babb15fc 100644
--- a/test/bench/binary-tree-freelist.go
+++ b/test/bench/binary-tree-freelist.go
@@ -42,7 +42,7 @@ import (
 	"os";
 )
 
-var n = flag.Int("n", 20, "depth")
+var n = flag.Int("n", 15, "depth")
 
 type Node struct {
 	  item	int;
@@ -108,7 +108,7 @@ func main() {
 	stretchDepth := maxDepth + 1;
 
 	check := bottomUpTree(0, stretchDepth).itemCheck();
-	fmt.Println("stretch tree of depth ", stretchDepth, "\t check:", check);
+	fmt.Printf("stretch tree of depth %d\t check: %d\n", stretchDepth, check);
 
 	longLivedTree := bottomUpTree(0, maxDepth);
 
@@ -124,7 +124,7 @@ func main() {
 			check += t.itemCheck();
 			t.free();
 		}
-		fmt.Println(iterations*2, "\t trees of depth ", depth, "\t check: ", check);
+		fmt.Printf("%d\t trees of depth %d\t check: %d\n", iterations*2, depth, check);
 	}
-	fmt.Println("long lived tree of depth", maxDepth, "\t check:", longLivedTree.itemCheck());
+	fmt.Printf("long lived tree of depth %d\t check: %d\n", maxDepth, longLivedTree.itemCheck());
 }