blob: 55e5a5f8c50d1fbb14c257564a3599fbac4f44a1 (
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
|
// 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]
public static class BubbleSort2
{
#if DEBUG
public const int Iterations = 1;
public const int Bound = 5 * Iterations;
#else
public const int Iterations = 15;
public const int Bound = 500 * Iterations;
#endif
static void Inner(int[] x) {
int limit1 = Bound - 1;
for (int i = 1; i <= limit1; i++) {
for (int j = i; j <= Bound; j++) {
if (x[i] > x[j]) {
int temp = x[j];
x[j] = x[i];
x[i] = temp;
}
}
}
}
[MethodImpl(MethodImplOptions.NoInlining)]
static bool Bench() {
int[] x = new int[Bound + 1];
int i, j;
int limit;
j = 99999;
limit = Bound - 2;
i = 1;
do {
x[i] = j & 32767;
x[i + 1] = (j + 11111) & 32767;
x[i + 2] = (j + 22222) & 32767;
j = j + 33333;
i = i + 3;
} while (i <= limit);
x[Bound - 1] = j;
x[Bound] = j;
Inner(x);
for (i = 0; i < Bound - 1; i++) {
if (x[i] > x[i + 1]) {
return false;
}
}
return true;
}
[Benchmark]
public static void Test() {
foreach (var iteration in Benchmark.Iterations) {
using (iteration.StartMeasurement()) {
for (int i = 0; i < Iterations; i++) {
Bench();
}
}
}
}
static bool TestBase() {
bool result = true;
for (int i = 0; i < Iterations; i++) {
result &= Bench();
}
return result;
}
public static int Main() {
bool result = TestBase();
return (result ? 100 : -1);
}
}
|
