bench: sieve.zc and trees.zc take namespace and include rt, so run.py's checksums pass on main again (todo item closed)

1 files changed, 10 insertions, 8 deletions

diff --git a/tests/bench/sieve.zc b/tests/bench/sieve.zc
index 9259bf4..9073201 100644
--- a/tests/bench/sieve.zc
+++ b/tests/bench/sieve.zc
@@ -1,3 +1,5 @@
+namespace;
+include rt;
 // primes below N. the same loops as tests/bench/sieve.c: one word per flag,
 // marks start at i*i. the count is 9592.
 //   a  fixed int[?], bounds-checked, plain bytecode
@@ -30,22 +32,22 @@ o3 int sieve_raw(int* f) {
 	return c;
 }
 int main() {
-	int which = get_c(), reps = 0, ch = get_c(), r = 0;
-	while (ch >= '0' && ch <= '9') { reps = reps * 10 + ch - '0'; ch = get_c(); }
+	int which = rt.get_c(), reps = 0, ch = rt.get_c(), r = 0;
+	while (ch >= '0' && ch <= '9') { reps = reps * 10 + ch - '0'; ch = rt.get_c(); }
 	if (which == 'c') {
-		int* raw = new(int, N);
+		int* raw = rt.new(int, N);
 		while (reps > 0) { r = sieve_raw(raw); reps--; }
-		put_n(r); put_c(10);
-		free(d*raw);
+		rt.put_n(r); rt.put_c(10);
+		rt.free(d*raw);
 		return 0;
 	}
-	fixed int[?] f = new(fixed int[?], N);
+	fixed int[?] f = rt.new(fixed int[?], N);
 	while (reps > 0) {
 		if (which == 'b') r = sieve3(f);
 		else r = sieve(f);
 		reps--;
 	}
-	put_n(r); put_c(10);
-	free(d*f);
+	rt.put_n(r); rt.put_c(10);
+	rt.free(d*f);
 	return 0;
 }