blob: 512f35f82d6994ab3ffac9a4de5e60ea55f1ebf9 (
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
|
// 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]
public static class Ackermann
{
#if DEBUG
public const int Iterations = 1;
#else
public const int Iterations = 100000;
#endif
static int Acker(int m, int n) {
if (m == 0) {
return n + 1;
}
else if (n == 0) {
return Acker(m - 1, 1);
}
else {
return Acker(m - 1, Acker(m, n - 1));
}
}
[MethodImpl(MethodImplOptions.NoInlining)]
static bool Bench() {
int a00 = Acker(0, 0);
int a11 = Acker(1, 1);
int a22 = Acker(2, 2);
int a33 = Acker(3, 3);
return (a00 == 1) && (a11 == 3) && (a22 == 7) & (a33 == 61);
}
[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);
}
}
|
