blob: b22aad88b7a2aec215c084eaab0e47562ef94885 (
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
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
|
// 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.BenchF
{
public static class SqMtx
{
#if DEBUG
public const int Iterations = 1;
#else
public const int Iterations = 4000;
#endif
private const int MatrixSize = 40;
private static T[][] AllocArray<T>(int n1, int n2)
{
T[][] a = new T[n1][];
for (int i = 0; i < n1; ++i)
{
a[i] = new T[n2];
}
return a;
}
[MethodImpl(MethodImplOptions.NoInlining)]
private static bool Bench()
{
double[][] a = AllocArray<double>(41, 41);
double[][] c = AllocArray<double>(41, 41);
int i, j;
for (i = 1; i <= MatrixSize; i++)
{
for (j = 1; j <= MatrixSize; j++)
{
a[i][j] = i + j;
}
}
for (i = 1; i <= Iterations; i++)
{
Inner(a, c, MatrixSize);
}
if (c[1][1] == 23820.0)
{
return true;
}
else
{
return false;
}
}
private static void Inner(double[][] a, double[][] c, int n)
{
for (int i = 1; i <= n; i++)
{
for (int j = 1; j <= n; j++)
{
c[i][j] = 0.0;
for (int k = 1; k <= n; k++)
{
c[i][j] = c[i][j] + a[i][k] * a[k][j];
}
}
}
}
[Benchmark]
public static void Test()
{
foreach (var iteration in Benchmark.Iterations)
{
using (iteration.StartMeasurement())
{
Bench();
}
}
}
private static bool TestBase()
{
bool result = Bench();
return result;
}
public static int Main()
{
bool result = TestBase();
return (result ? 100 : -1);
}
}
}
|
