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
|
// 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 BenchE
{
#if DEBUG
public const int Iterations = 1;
#else
public const int Iterations = 5000000;
#endif
private static int s_position;
private static int Strsch(char[] s, char[] k, int ns, int nk)
{
int i, j;
int start, ksave, cont;
int kend, ssave;
int r;
start = 0;
ksave = 0;
cont = ns - nk + start;
kend = ksave + nk - 1;
i = 0;
j = 0;
top:
while (s[i] != k[j])
{
// s is accessed upto cont i.e. ns - nk + 0
if (i >= cont)
{
r = -1;
goto bottom;
}
i = i + 1;
}
ssave = i;
j = j + 1;
while (j <= kend)
{
i = i + 1;
// j <= kend, so k is accessed upto 0 + nk - 1
if (s[i] != k[j])
{
i = ssave + 1;
j = ksave;
goto top;
}
j = j + 1;
}
r = ssave - start + 1;
bottom:
return r;
}
private static void BenchInner(char[] s, char[] k)
{
int ns, nk;
ns = 120;
nk = 15;
s_position = Strsch(s, k, ns, nk);
}
[MethodImpl(MethodImplOptions.NoInlining)]
private static bool Bench()
{
char[] s = {
'0', '0', '0', '0', '0', '0', '0', '0', '0', '0', '0', '0', '0', '0', '0', '0', '0', '0', '0', '0', '0', '0', '0', '0', '0', '0', '0', '0', '0', '0', '0', '0', '0', '0', '0', '0', '0', '0', '0', '0', '0', '0', '0', '0', '0', '0', '0', '0', '0', '0', '0', '0', '0', '0', '0', '0', '0', '0', '0', '0', 'H', 'E', 'R', 'E', '0', '0', '0', '0', '0', '0', '0', '0', '0', '0', '0', '0', '0', '0', '0', '0', '0', '0', '0', '0', '0', '0', '0', '0', '0', '0',
'H', 'E', 'R', 'E', ' ', 'I', 'S', ' ', 'A', ' ', 'M', 'A', 'T', 'C', 'H', '0', '0', '0', '0', '0', '0', '0', '0', '0', '0', '0', '0', '0', '0', '0'
};
char[] k = { 'H', 'E', 'R', 'E', ' ', 'I', 'S', ' ', 'A', ' ', 'M', 'A', 'T', 'C', 'H', ' ', ' ', ' ', ' ', ' ', ' ', ' ', ' ', ' ', ' ', ' ', ' ', ' ', ' ', ' ', ' ', ' ', ' ', ' ', ' ', ' ', ' ', ' ', ' ', ' ' };
for (int i = 0; i < Iterations; i++)
{
BenchInner(s, k);
}
return (s_position == 91);
}
[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);
}
}
}
|