-
Notifications
You must be signed in to change notification settings - Fork 272
/
AddArray2.cs
97 lines (87 loc) · 2.22 KB
/
AddArray2.cs
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
// 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 System.Runtime.CompilerServices;
using BenchmarkDotNet.Attributes;
using MicroBenchmarks;
namespace Benchstone.BenchI
{
[BenchmarkCategory(Categories.Runtime, Categories.Benchstones, Categories.JIT, Categories.BenchI)]
public class AddArray2
{
private const int Dim = 200;
int[][] array = AllocArray<int>(Dim + 1, Dim + 1);
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;
}
private static
void BenchInner1(int[][] a, ref int nn)
{
int n;
int l, m;
n = nn;
for (int i = 1; i <= n; i++)
{
for (int j = (i + 1); j <= n; j++)
{
for (int k = 1; k <= n; k++)
{
l = a[i][k];
m = a[j][k];
unchecked
{
a[j][k] = l + m;
}
}
}
}
}
private static
void BenchInner2(int[][] a, ref int nn)
{
int n;
int l, m;
n = nn;
for (int i = 1; i <= n; i++)
{
for (int j = (i + 1); j <= n; j++)
{
for (int k = 1; k <= n; k++)
{
l = a[k][i];
m = a[k][j];
unchecked
{
a[k][j] = l + m;
}
}
}
}
}
[MethodImpl(MethodImplOptions.NoInlining)]
private static bool Bench(int[][] a)
{
int n = Dim;
for (int i = 1; i <= n; i++)
{
for (int j = 1; j <= n; j++)
{
a[i][j] = i + j;
}
}
BenchInner1(a, ref n);
n = Dim;
BenchInner2(a, ref n);
return true;
}
[Benchmark(Description = nameof(AddArray2))]
public bool Test() => Bench(array);
}
}