blob: 2867abc4d4153036c3be74a82e412eaeb3354b14 (
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
|
// 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 class TreeInsert
{
#if DEBUG
public const int Iterations = 1;
#else
public const int Iterations = 15000;
#endif
private struct Node
{
public int A;
public int L;
public int R;
}
private struct Tree
{
public int Root;
public int NextAvail;
public Node[] Nodes;
}
private Tree _s;
public TreeInsert()
{
_s.Nodes = new Node[10001];
}
private void BenchInner(int x)
{
/* a tree insertion routine from knuth */
int i = _s.Root;
int j = _s.NextAvail;
L10:
/* compare */
if (_s.Nodes[i].A < x)
{
if (_s.Nodes[i].L != 0)
{
i = _s.Nodes[i].L;
goto L10;
}
else
{
_s.Nodes[i].L = j;
goto L20;
}
}
else
{
if (_s.Nodes[i].R != 0)
{
i = _s.Nodes[i].R;
goto L10;
}
else
{
_s.Nodes[i].R = j;
goto L20;
}
}
L20:
/* insert */
_s.Nodes[j].A = x;
_s.Nodes[j].L = 0;
_s.Nodes[j].R = 0;
_s.NextAvail = j + 1;
}
[MethodImpl(MethodImplOptions.NoInlining)]
private bool Bench()
{
_s.Root = 1;
_s.NextAvail = 2;
_s.Nodes[1].A = 300;
_s.Nodes[1].L = 0;
_s.Nodes[1].R = 0;
int j = 99999;
for (int i = 1; i <= 900; i++)
{
BenchInner(j & 4095);
j = j + 33333;
}
return (_s.Nodes[500].A == 441);
}
[Benchmark]
public static void Test()
{
TreeInsert T = new TreeInsert();
foreach (var iteration in Benchmark.Iterations)
{
using (iteration.StartMeasurement())
{
for (int i = 1; i <= Iterations; i++)
{
T.Bench();
}
}
}
}
private static bool TestBase()
{
TreeInsert T = new TreeInsert();
bool result = true;
for (int i = 1; i <= Iterations; i++)
{
result &= T.Bench();
}
return result;
}
public static int Main()
{
bool result = TestBase();
return (result ? 100 : -1);
}
}
}
|
