blob: 2fe0918784d2dd1a440e52795df0b9dafe528bca (
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
86
87
88
89
|
// 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.
//
using Microsoft.Xunit.Performance;
using System;
using System.Runtime.CompilerServices;
using Xunit;
[assembly: OptimizeForBenchmarks]
[assembly: MeasureInstructionsRetired]
namespace Benchstone.BenchI
{
public static class Pi
{
#if DEBUG
public const int Iterations = 1;
#else
public const int Iterations = 100;
#endif
static int[] ComputePi(int[] a) {
int d = 4;
int r = 10000;
int n = 251;
int m = (int)(3.322 * n * d);
int[] digits = new int[n];
int i, k, q;
for (i = 0; i <= m; i++) {
a[i] = 2;
}
a[m] = 4;
for (i = 1; i <= n; i++) {
q = 0;
for (k = m; k > 0L; k--) {
a[k] = a[k] * r + q;
q = a[k] / (2 * k + 1);
a[k] -= (2 * k + 1) * q;
q *= k;
}
a[0] = a[0] * r + q;
q = a[0] / r;
a[0] -= q * r;
digits[i-1] = q;
}
return digits;
}
[MethodImpl(MethodImplOptions.NoInlining)]
static bool Bench(int[] a) {
int[] digits = ComputePi(a);
return (digits[0] == 3 && digits[1] == 1415 && digits[2] == 9265 && digits[250] == 1989);
}
[Benchmark]
public static void Test() {
int[] a = new int[3340];
foreach (var iteration in Benchmark.Iterations) {
using (iteration.StartMeasurement()) {
for (int i = 0; i < Iterations; i++) {
Bench(a);
}
}
}
}
static bool TestBase() {
bool result = true;
int[] a = new int[3340];
for (int i = 0; i < Iterations; i++) {
result &= Bench(a);
}
return result;
}
public static int Main() {
bool result = TestBase();
return (result ? 100 : -1);
}
}
}
|
