blob: 907320170e09db57b0c88b3949f734851a6aeb67 (
plain) (
blame)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
|
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
// b the same function lifted by o3
// c o3 through a raw *int, no per-index check
const int N = 100000;
int sieve(fixed int[?] f) {
int n = len(f), c = 0;
for (int i = 2; i < n; i++) f[i] = 1;
for (int i = 2; i * i < n; i++)
if (f[i]) for (int j = i * i; j < n; j += i) f[j] = 0;
for (int i = 2; i < n; i++) c += f[i];
return c;
}
o3 int sieve3(fixed int[?] f) {
int n = len(f), c = 0;
for (int i = 2; i < n; i++) f[i] = 1;
for (int i = 2; i * i < n; i++)
if (f[i]) for (int j = i * i; j < n; j += i) f[j] = 0;
for (int i = 2; i < n; i++) c += f[i];
return c;
}
o3 int sieve_raw(int* f) {
int n = N, c = 0;
for (int i = 2; i < n; i++) f[i] = 1;
for (int i = 2; i * i < n; i++)
if (f[i]) for (int j = i * i; j < n; j += i) f[j] = 0;
for (int i = 2; i < n; i++) c += f[i];
return c;
}
int main() {
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 = rt.new(int, N);
while (reps > 0) { r = sieve_raw(raw); reps--; }
rt.put_n(r); rt.put_c(10);
rt.free(d*raw);
return 0;
}
fixed int[?] f = rt.new(fixed int[?], N);
while (reps > 0) {
if (which == 'b') r = sieve3(f);
else r = sieve(f);
reps--;
}
rt.put_n(r); rt.put_c(10);
rt.free(d*f);
return 0;
}
|
