1 files changed, 97 insertions, 0 deletions
diff --git a/tests/src/JIT/Performance/CodeQuality/BenchI/LogicArray/LogicArray.cs b/tests/src/JIT/Performance/CodeQuality/BenchI/LogicArray/LogicArray.cs
new file mode 100644
index 0000000000..f5ff746b86
--- /dev/null
+++ b/tests/src/JIT/Performance/CodeQuality/BenchI/LogicArray/LogicArray.cs
@@ -0,0 +1,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 Microsoft.Xunit.Performance;
+using System;
+using System.Runtime.CompilerServices;
+using Xunit;
+
+[assembly: OptimizeForBenchmarks]
+[assembly: MeasureInstructionsRetired]
+
+public static class LogicArray
+{
+
+#if DEBUG
+    public const int Iterations = 1;
+#else
+    public const int Iterations = 3000;
+#endif
+
+    const int ArraySize = 50;
+
+    struct Workarea
+    {
+        public int X;
+        public int[][] A;
+    }
+
+    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;
+    }
+
+    static bool Inner(ref Workarea cmn) {
+        int i, j, k;
+        cmn.X = 0;
+        for (i = 1; i <= 50; i++) {
+            for (j = 1; j <= 50; j++) {
+                cmn.A[i][j] = 1;
+            }
+        }
+        for (k = 1; k <= 50; k++) {
+            for (j = 1; j <= 50; j++) {
+                i = 1;
+                do {
+                    cmn.X = cmn.X | cmn.A[i][j] & cmn.A[i + 1][k];
+                    i = i + 2;
+                } while (i <= 50);
+            }
+        }
+        if (cmn.X != 1) {
+            return false;
+        }
+        else {
+            return true;
+        }
+    }
+
+    [MethodImpl(MethodImplOptions.NoInlining)]
+    static bool Bench() {
+        Workarea cmn = new Workarea();
+        cmn.X = 0;
+        cmn.A = AllocArray<int>(51, 51);
+        for (int n = 1; n <= Iterations; n++) {
+            bool result = Inner(ref cmn);
+            if (!result) {
+                return false;
+            }
+        }
+
+        return true;
+    }
+
+    [Benchmark]
+    public static void Test() {
+        foreach (var iteration in Benchmark.Iterations) {
+            using (iteration.StartMeasurement()) {
+                Bench();
+            }
+        }
+    }
+
+    static bool TestBase() {
+        bool result = Bench();
+        return result;
+    }
+    
+    public static int Main() {
+        bool result = TestBase();
+        return (result ? 100 : -1);
+    }
+}