1 files changed, 160 insertions, 0 deletions
diff --git a/tests/src/JIT/opt/Loops/SearchLoopTail.cs b/tests/src/JIT/opt/Loops/SearchLoopTail.cs
new file mode 100644
index 0000000000..10be60c021
--- /dev/null
+++ b/tests/src/JIT/opt/Loops/SearchLoopTail.cs
@@ -0,0 +1,160 @@
+// 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.
+
+// Test for tail merging/duplication of search loops returning constants.
+
+using System.Runtime.CompilerServices;
+
+namespace N
+{
+    public static class C
+    {
+        [MethodImpl(MethodImplOptions.NoInlining)]
+        static bool HasPrimeUnderTwenty(int first, int last)
+        {
+            for (int n = first; n <= last; ++n)
+            {
+                if (n == 2) return true;
+                if (n == 3) return true;
+                if (n == 5) return true;
+                if (n == 7) return true;
+                if (n == 11) return true;
+                if (n == 13) return true;
+                if (n == 17) return true;
+                if (n == 19) return true;
+            }
+
+            return false;
+        }
+
+        [MethodImpl(MethodImplOptions.NoInlining)]
+        static int Distance_abCD(string s)
+        {
+            int c_index = 0;
+            bool sawA = false;
+            bool sawB = false;
+            int index = 0;
+
+            foreach (char c in s)
+            {
+                if (c == 'A') sawA = true;
+                if (c == 'B')
+                {
+                    if (!sawA) return -1;
+                    sawB = true;
+                }
+                if (c == 'C')
+                {
+                    if (!sawB) return -1;
+                    c_index = index;
+                }
+                if (c == 'D')
+                {
+                    if (c_index == 0) return -1;
+                    return (index - c_index);
+                }
+                ++index;
+            }
+
+            return -1;
+        }
+
+        [MethodImpl(MethodImplOptions.NoInlining)]
+        static bool TrueFalseOr(int[] input)
+        {
+            int n = 0, m = 0;
+            for (int i = 0; i < input.Length; ++i)
+            {
+                m = n;
+                n = input[i];
+                if (n < 7)
+                    return true;
+                if (n > 22)
+                    return false;
+                if (n == 12)
+                    return (m == 5);
+            }
+
+            return (n == 9 || m == 13);
+        }
+
+        [MethodImpl(MethodImplOptions.NoInlining)]
+        static bool TrueFalseAnd(int[] input)
+        {
+            int n = 0, m = 0;
+            for (int i = 0; i < input.Length; ++i)
+            {
+                m = n;
+                n = input[i];
+                if (n < 7)
+                    return true;
+                if (n > 22)
+                    return false;
+                if (n == 12)
+                    return (m == 5);
+            }
+
+            return (n == 9 && m == 13);
+        }
+
+        [MethodImpl(MethodImplOptions.NoInlining)]
+        static bool FalseTrueOr(int[] input)
+        {
+            int n = 0, m = 0;
+            for (int i = 0; i < input.Length; ++i)
+            {
+                m = n;
+                n = input[i];
+                if (n < 7)
+                    return false;
+                if (n > 22)
+                    return true;
+                if (n == 12)
+                    return (m == 5);
+            }
+
+            return (n == 9 || m == 13);
+        }
+
+        [MethodImpl(MethodImplOptions.NoInlining)]
+        static bool FalseTrueAnd(int[] input)
+        {
+            int n = 0, m = 0;
+            for (int i = 0; i < input.Length; ++i)
+            {
+                m = n;
+                n = input[i];
+                if (n < 7)
+                    return false;
+                if (n > 22)
+                    return true;
+                if (n == 12)
+                    return (m == 5);
+            }
+
+            return (n == 9 && m == 13);
+        }
+
+        public static int Main(string[] args)
+        {
+            if (HasPrimeUnderTwenty(22, 36) || !HasPrimeUnderTwenty(-1, 4))
+            {
+                return -1;
+            }
+
+            if ((Distance_abCD("xxxxAyyyyBzyzyzC1234D") != 5) || (Distance_abCD("nnABmmDC") != -1))
+            {
+                return -1;
+            }
+
+            int[] inputs = new int[] { 8, 20, 11, 13, 15 };
+            if (!TrueFalseOr(inputs) || TrueFalseAnd(inputs) || !FalseTrueOr(inputs) || FalseTrueAnd(inputs))
+            {
+                return -1;
+            }
+
+            return 100;
+        }
+    }
+}