blob: de8b4860497fb884acb082b38641129befcb9554 (
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
|
// 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 XposMatrix
{
public const int ArraySize = 100;
#if DEBUG
public const int Iterations = 1;
#else
public const int Iterations = 25000;
#endif
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[][] x, int n) {
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= n; j++) {
int t = x[i][j];
x[i][j] = x[j][i];
x[j][i] = t;
}
}
}
[MethodImpl(MethodImplOptions.NoInlining)]
static bool Bench(int[][] matrix) {
int n = ArraySize;
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= n; j++) {
matrix[i][j] = 1;
}
}
if (matrix[n][n] != 1) {
return false;
}
Inner(matrix, n);
if (matrix[n][n] != 1) {
return false;
}
return true;
}
[Benchmark]
public static void Test() {
int[][] matrix = AllocArray<int>(ArraySize + 1, ArraySize + 1);
foreach (var iteration in Benchmark.Iterations) {
using (iteration.StartMeasurement()) {
for (int i = 0; i < Iterations; i++) {
Bench(matrix);
}
}
}
}
static bool TestBase() {
int[][] matrix = AllocArray<int>(ArraySize + 1, ArraySize + 1);
bool result = true;
for (int i = 0; i < Iterations; i++) {
result &= Bench(matrix);
}
return result;
}
public static int Main() {
bool result = TestBase();
return (result ? 100 : -1);
}
}
}
|
