summaryrefslogtreecommitdiff
path: root/tests/src/JIT/Performance/CodeQuality/Bytemark/ByteMark.cs
diff options
context:
space:
mode:
Diffstat (limited to 'tests/src/JIT/Performance/CodeQuality/Bytemark/ByteMark.cs')
-rw-r--r--tests/src/JIT/Performance/CodeQuality/Bytemark/ByteMark.cs31
1 files changed, 15 insertions, 16 deletions
diff --git a/tests/src/JIT/Performance/CodeQuality/Bytemark/ByteMark.cs b/tests/src/JIT/Performance/CodeQuality/Bytemark/ByteMark.cs
index 280744bf5b..79e7c5e709 100644
--- a/tests/src/JIT/Performance/CodeQuality/Bytemark/ByteMark.cs
+++ b/tests/src/JIT/Performance/CodeQuality/Bytemark/ByteMark.cs
@@ -3,7 +3,7 @@
// See the LICENSE file in the project root for more information.
/*
** This program was translated to C# and adapted for xunit-performance.
-** New variants of several tests were added to compare class versus
+** New variants of several tests were added to compare class versus
** struct and to compare jagged arrays vs multi-dimensional arrays.
*/
@@ -24,7 +24,7 @@
** are error-free. Consequently, McGraw-HIll and BYTE Magazine make
** no claims in regard to the fitness of the source code, executable
** code, and documentation of the BYTEmark.
-**
+**
** Furthermore, BYTE Magazine, McGraw-Hill, and all employees
** of McGraw-Hill cannot be held responsible for any damages resulting
** from the use of this code or the results obtained from using
@@ -36,7 +36,6 @@ using System;
using System.IO;
[assembly: OptimizeForBenchmarks]
-[assembly: MeasureInstructionsRetired]
internal class global
{
@@ -1273,7 +1272,7 @@ public class ByteMark
{
using (iteration.StartMeasurement())
{
- for (int i = 0; i < NumericSortJaggedIterations; i++)
+ for (int i = 0; i < NumericSortJaggedIterations; i++)
{
t.Run();
}
@@ -1295,7 +1294,7 @@ public class ByteMark
{
using (iteration.StartMeasurement())
{
- for (int i = 0; i < NumericSortRectangularIterations; i++)
+ for (int i = 0; i < NumericSortRectangularIterations; i++)
{
t.Run();
}
@@ -1317,7 +1316,7 @@ public class ByteMark
{
using (iteration.StartMeasurement())
{
- for (int i = 0; i < StringSortIterations; i++)
+ for (int i = 0; i < StringSortIterations; i++)
{
t.Run();
}
@@ -1338,7 +1337,7 @@ public class ByteMark
{
using (iteration.StartMeasurement())
{
- for (int i = 0; i < BitOpsIterations; i++)
+ for (int i = 0; i < BitOpsIterations; i++)
{
t.Run();
}
@@ -1360,7 +1359,7 @@ public class ByteMark
{
using (iteration.StartMeasurement())
{
- for (int i = 0; i < EmFloatIterations; i++)
+ for (int i = 0; i < EmFloatIterations; i++)
{
t.Run();
}
@@ -1382,7 +1381,7 @@ public class ByteMark
{
using (iteration.StartMeasurement())
{
- for (int i = 0; i < EmFloatClassIterations; i++)
+ for (int i = 0; i < EmFloatClassIterations; i++)
{
t.Run();
}
@@ -1403,7 +1402,7 @@ public class ByteMark
{
using (iteration.StartMeasurement())
{
- for (int i = 0; i < FourierIterations; i++)
+ for (int i = 0; i < FourierIterations; i++)
{
t.Run();
}
@@ -1425,7 +1424,7 @@ public class ByteMark
{
using (iteration.StartMeasurement())
{
- for (int i = 0; i < AssignJaggedIterations; i++)
+ for (int i = 0; i < AssignJaggedIterations; i++)
{
t.Run();
}
@@ -1447,7 +1446,7 @@ public class ByteMark
{
using (iteration.StartMeasurement())
{
- for (int i = 0; i < AssignRectangularIterations; i++)
+ for (int i = 0; i < AssignRectangularIterations; i++)
{
t.Run();
}
@@ -1469,7 +1468,7 @@ public class ByteMark
{
using (iteration.StartMeasurement())
{
- for (int i = 0; i < IDEAEncryptionIterations; i++)
+ for (int i = 0; i < IDEAEncryptionIterations; i++)
{
t.Run();
}
@@ -1491,7 +1490,7 @@ public class ByteMark
{
using (iteration.StartMeasurement())
{
- for (int i = 0; i < NeuralJaggedIterations; i++)
+ for (int i = 0; i < NeuralJaggedIterations; i++)
{
t.Run();
}
@@ -1513,7 +1512,7 @@ public class ByteMark
{
using (iteration.StartMeasurement())
{
- for (int i = 0; i < NeuralIterations; i++)
+ for (int i = 0; i < NeuralIterations; i++)
{
t.Run();
}
@@ -1535,7 +1534,7 @@ public class ByteMark
{
using (iteration.StartMeasurement())
{
- for (int i = 0; i < LUDecompIterations; i++)
+ for (int i = 0; i < LUDecompIterations; i++)
{
t.Run();
}