blob: 202ed3c052255e2fa39389ea3cd2b193a6e83f7f (
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
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
|
// 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]
namespace Benchstone.BenchI
{
public static class MulMatrix
{
#if DEBUG
public const int Iterations = 1;
#else
public const int Iterations = 100;
#endif
const int Size = 75;
static volatile object VolatileObject;
static void Escape(object obj) {
VolatileObject = obj;
}
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;
}
static void Inner(int[][] a, int[][] b, int[][] c) {
int i, j, k, l;
// setup
for (j = 0; j < Size; j++) {
for (i = 0; i < Size; i++) {
a[i][j] = i;
b[i][j] = 2 * j;
c[i][j] = a[i][j] + b[i][j];
}
}
// jkl
for (j = 0; j < Size; j++) {
for (k = 0; k < Size; k++) {
for (l = 0; l < Size; l++) {
c[j][k] += a[j][l] * b[l][k];
}
}
}
// jlk
for (j = 0; j < Size; j++) {
for (l = 0; l < Size; l++) {
for (k = 0; k < Size; k++) {
c[j][k] += a[j][l] * b[l][k];
}
}
}
// kjl
for (k = 0; k < Size; k++) {
for (j = 0; j < Size; j++) {
for (l = 0; l < Size; l++) {
c[j][k] += a[j][l] * b[l][k];
}
}
}
// klj
for (k = 0; k < Size; k++) {
for (l = 0; l < Size; l++) {
for (j = 0; j < Size; j++) {
c[j][k] += a[j][l] * b[l][k];
}
}
}
// ljk
for (l = 0; l < Size; l++) {
for (j = 0; j < Size; j++) {
for (k = 0; k < Size; k++) {
c[j][k] += a[j][l] * b[l][k];
}
}
}
// lkj
for (l = 0; l < Size; l++) {
for (k = 0; k < Size; k++) {
for (j = 0; j < Size; j++) {
c[j][k] += a[j][l] * b[l][k];
}
}
}
return;
}
[MethodImpl(MethodImplOptions.NoInlining)]
static bool Bench() {
int[][] a = AllocArray<int>(Size, Size);
int[][] b = AllocArray<int>(Size, Size);
int[][] c = AllocArray<int>(Size, Size);
for (int i = 0; i < Iterations; ++i) {
Inner(a, b, c);
}
Escape(c);
return true;
}
[Benchmark]
public static void Test() {
foreach (var iteration in Benchmark.Iterations) {
using (iteration.StartMeasurement()) {
Bench();
}
}
}
static bool TestBase() {
bool result = Bench();
return result;
}
public static int Main() {
bool result = TestBase();
return (result ? 100 : -1);
}
}
}
|
