blob: aca263711ddf035a10c8660764491ae9352165af (
plain)
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
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
|
// Licensed to the .NET Foundation under one or more agreements.
// The .NET Foundation licenses this file to you under the MIT license.
// See the LICENSE file in the project root for more information.
//
// Based on Eratosthenes Sieve Prime Number Program in C, Byte Magazine, January 1983.
using Microsoft.Xunit.Performance;
using System;
using System.Runtime.CompilerServices;
using Xunit;
[assembly: OptimizeForBenchmarks]
[assembly: MeasureInstructionsRetired]
namespace Benchstone.BenchI
{
public static class CSieve
{
#if DEBUG
public const int Iterations = 1;
#else
public const int Iterations = 200;
#endif
const int Size = 8190;
[MethodImpl(MethodImplOptions.NoInlining)]
static bool Bench() {
bool[] flags = new bool[Size + 1];
int count = 0;
for (int iter = 1; iter <= Iterations; iter++)
{
count = 0;
// Initially, assume all are prime
for (int i = 0; i <= Size; i++)
{
flags[i] = true;
}
// Refine
for (int i = 2; i <= Size; i++)
{
if (flags[i])
{
// Found a prime
for (int k = i + i; k <= Size; k += i)
{
// Cancel its multiples
flags[k] = false;
}
count++;
}
}
}
return (count == 1027);
}
[Benchmark]
public static void Test() {
foreach (var iteration in Benchmark.Iterations) {
using (iteration.StartMeasurement()) {
for (int i = 0; i < Iterations; i++) {
Bench();
}
}
}
}
static bool TestBase() {
bool result = true;
for (int i = 0; i < Iterations; i++) {
result &= Bench();
}
return result;
}
public static int Main() {
bool result = TestBase();
return (result ? 100 : -1);
}
}
}
|
