diff a/test/micro/org/openjdk/bench/valhalla/acmp/FastPath.java b/test/micro/org/openjdk/bench/valhalla/acmp/FastPath.java
--- /dev/null
+++ b/test/micro/org/openjdk/bench/valhalla/acmp/FastPath.java
@@ -0,0 +1,719 @@
+/*
+ * Copyright (c) 2026, Oracle and/or its affiliates. All rights reserved.
+ * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
+ *
+ * This code is free software; you can redistribute it and/or modify it
+ * under the terms of the GNU General Public License version 2 only, as
+ * published by the Free Software Foundation.
+ *
+ * This code is distributed in the hope that it will be useful, but WITHOUT
+ * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
+ * FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
+ * version 2 for more details (a copy is included in the LICENSE file that
+ * accompanied this code).
+ *
+ * You should have received a copy of the GNU General Public License version
+ * 2 along with this work; if not, write to the Free Software Foundation,
+ * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
+ *
+ * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
+ * or visit www.oracle.com if you need additional information or have any
+ * questions.
+ */
+package org.openjdk.bench.valhalla.acmp;
+
+import org.openjdk.jmh.annotations.Benchmark;
+import org.openjdk.jmh.annotations.BenchmarkMode;
+import org.openjdk.jmh.annotations.CompilerControl;
+import org.openjdk.jmh.annotations.Fork;
+import org.openjdk.jmh.annotations.Measurement;
+import org.openjdk.jmh.annotations.Mode;
+import org.openjdk.jmh.annotations.OperationsPerInvocation;
+import org.openjdk.jmh.annotations.OutputTimeUnit;
+import org.openjdk.jmh.annotations.Scope;
+import org.openjdk.jmh.annotations.Setup;
+import org.openjdk.jmh.annotations.State;
+import org.openjdk.jmh.annotations.Warmup;
+
+import java.util.concurrent.TimeUnit;
+
+@Fork(value = 3, jvmArgsAppend = {"--enable-preview"})
+@Warmup(iterations = 3, time = 1)
+@Measurement(iterations = 5, time = 1)
+@OutputTimeUnit(TimeUnit.NANOSECONDS)
+@BenchmarkMode(Mode.AverageTime)
+@State(Scope.Thread)
+public class FastPath {
+    public static final int SIZE = 100;
+
+    @CompilerControl(CompilerControl.Mode.DONT_INLINE)
+    private static int acmp(Object[] objects1, Object[] objects2) {
+        int s = 0;
+        for (int i = 0; i < SIZE; i++) {
+            if (objects1[i] == objects2[i]) {
+                s += 1;
+            } else {
+                s -= 1;
+            }
+        }
+        return s;
+    }
+
+
+    // Homogeneous arrays, all go to fast path, all pairwise equal
+    @Benchmark
+    @OperationsPerInvocation(SIZE)
+    @CompilerControl(CompilerControl.Mode.INLINE)
+    public int homogeneous_eq(ObjStateHomogeneousAllEq st) {
+        return acmp(st.arr1, st.arr2);
+    }
+
+    // Homogeneous arrays, all go to fast path, all pairwise unequal
+    @Benchmark
+    @OperationsPerInvocation(SIZE)
+    @CompilerControl(CompilerControl.Mode.INLINE)
+    public int homogeneous_neq(ObjStateHomogeneousAllNeq st) {
+        return acmp(st.arr1, st.arr2);
+    }
+
+    // Homogeneous arrays, all go to fast path
+    @Benchmark
+    @OperationsPerInvocation(SIZE)
+    @CompilerControl(CompilerControl.Mode.INLINE)
+    public int homogeneous_eq_neq(ObjStateHomogeneousEqNeq st) {
+        return acmp(st.arr1, st.arr2);
+    }
+
+    // Heterogeneous arrays, all go to fast path, all pairwise equal
+    @Benchmark
+    @OperationsPerInvocation(SIZE)
+    @CompilerControl(CompilerControl.Mode.INLINE)
+    public int heterogeneous_eq(ObjStateHeterogeneousAllEq st) {
+        return acmp(st.arr1, st.arr2);
+    }
+
+    // Heterogeneous arrays, all go to fast path, all pairwise unequal but same type
+    @Benchmark
+    @OperationsPerInvocation(SIZE)
+    @CompilerControl(CompilerControl.Mode.INLINE)
+    public int heterogeneous_neq(ObjStateHeterogeneousAllNeq st) {
+        return acmp(st.arr1, st.arr2);
+    }
+
+    // Heterogeneous arrays, all go to fast path, all pairwise of same type
+    @Benchmark
+    @OperationsPerInvocation(SIZE)
+    @CompilerControl(CompilerControl.Mode.INLINE)
+    public int heterogeneous_eq_neq(ObjStateHeterogeneousEqNeq st) {
+        return acmp(st.arr1, st.arr2);
+    }
+
+    // Heterogeneous arrays, all cases with same types go to fast path, using migrated classes
+    @Benchmark
+    @OperationsPerInvocation(SIZE)
+    @CompilerControl(CompilerControl.Mode.INLINE)
+    public int numeric_classes(ObjStateNumeric st) {
+        return acmp(st.arr1, st.arr2);
+    }
+
+    // Heterogeneous arrays, all cases with same types go to fast path, using single field user-defined classes
+    @Benchmark
+    @OperationsPerInvocation(SIZE)
+    @CompilerControl(CompilerControl.Mode.INLINE)
+    public int custom_single_field(ObjStateSingleField st) {
+        return acmp(st.arr1, st.arr2);
+    }
+
+    // Heterogeneous arrays, all cases with same types go to fast path, using multi-field user-defined classes
+    @Benchmark
+    @OperationsPerInvocation(SIZE)
+    @CompilerControl(CompilerControl.Mode.INLINE)
+    public int custom_multi_field(ObjStateMultiField st) {
+        return acmp(st.arr1, st.arr2);
+    }
+
+    // Heterogeneous arrays, nothing goes to fast path because the payload is too big for fast path
+    @Benchmark
+    @OperationsPerInvocation(SIZE)
+    @CompilerControl(CompilerControl.Mode.INLINE)
+    public int too_big(ObjStateTooBig st) {
+        return acmp(st.arr1, st.arr2);
+    }
+
+    // Heterogeneous arrays, nothing goes to fast path because the payload contains an oop
+    @Benchmark
+    @OperationsPerInvocation(SIZE)
+    @CompilerControl(CompilerControl.Mode.INLINE)
+    public int with_oops(ObjStateWithOop st) {
+        return acmp(st.arr1, st.arr2);
+    }
+
+    // Arrays of empty value objects, all equal, and fast path
+    @Benchmark
+    @OperationsPerInvocation(SIZE)
+    @CompilerControl(CompilerControl.Mode.INLINE)
+    public int empty_objects(ObjStateEmpty st) {
+        return acmp(st.arr1, st.arr2);
+    }
+
+    // Arrays of empty value objects, all equal, and fast path
+    @Benchmark
+    @OperationsPerInvocation(SIZE)
+    @CompilerControl(CompilerControl.Mode.INLINE)
+    public int empty_objects_heterogeneous(ObjStateHeterogeneousEmpty st) {
+        return acmp(st.arr1, st.arr2);
+    }
+
+    // All is identity objects
+    @Benchmark
+    @OperationsPerInvocation(SIZE)
+    @CompilerControl(CompilerControl.Mode.INLINE)
+    public int identity_objects(ObjStateIdentity st) {
+        return acmp(st.arr1, st.arr2);
+    }
+
+    // Big mix of fast path value classes, no fast path value classes, identity classes and null
+    @Benchmark
+    @OperationsPerInvocation(SIZE)
+    @CompilerControl(CompilerControl.Mode.INLINE)
+    public int big_mix(ObjStateBigMix st) {
+        return acmp(st.arr1, st.arr2);
+    }
+
+
+    @State(Scope.Thread)
+    public abstract static class ObjStateHomogeneous {
+        Object[] arr1, arr2;
+
+        public void setup(int mode) {
+            arr1 = new Object[SIZE];
+            arr2 = new Object[SIZE];
+
+            for (int i = 0; i < SIZE; i++) {
+                switch (mode) {
+                    case 0:
+                        arr1[i] = new Integer(i);
+                        arr2[i] = new Integer(i);
+                        break;
+                    case 1:
+                        arr1[i] = new Integer(i);
+                        arr2[i] = new Integer(-i);
+                        break;
+                    case 2:
+                        arr1[i] = new Integer(i);
+                        if (i % 2 == 0) {
+                            arr2[i] = new Integer(i);
+                        } else {
+                            arr2[i] = new Integer(-i);
+                        }
+                        break;
+                }
+            }
+        }
+    }
+
+    public static class ObjStateHomogeneousAllEq extends ObjStateHomogeneous {
+        @Setup
+        public void setup() {
+            setup(0);
+        }
+    }
+
+    public static class ObjStateHomogeneousAllNeq extends ObjStateHomogeneous {
+        @Setup
+        public void setup() {
+            setup(1);
+        }
+    }
+
+    public static class ObjStateHomogeneousEqNeq extends ObjStateHomogeneous {
+        @Setup
+        public void setup() {
+            setup(2);
+        }
+    }
+
+    @State(Scope.Thread)
+    public abstract static class ObjStateHeterogeneous {
+        Object[] arr1, arr2;
+
+        public void setup(int mode) {
+            arr1 = new Object[SIZE];
+            arr2 = new Object[SIZE];
+
+            for (int i = 0; i < SIZE; i++) {
+                if (i % 2 == 0) {
+                    switch (mode) {
+                        case 0:
+                            arr1[i] = new Integer(i);
+                            arr2[i] = new Integer(i);
+                            break;
+                        case 1:
+                            arr1[i] = new Integer(i);
+                            arr2[i] = new Integer(-i);
+                            break;
+                        case 2:
+                            arr1[i] = new Integer(i);
+                            if (i % 4 == 0) {
+                                arr2[i] = new Integer(i);
+                            } else {
+                                arr2[i] = new Integer(-i);
+                            }
+                            break;
+                    }
+                } else {
+                    switch (mode) {
+                        case 0:
+                            arr1[i] = new Short((short) i);
+                            arr2[i] = new Short((short) i);
+                            break;
+                        case 1:
+                            arr1[i] = new Short((short) i);
+                            arr2[i] = new Short((short) -i);
+                            break;
+                        case 2:
+                            arr1[i] = new Short((short) i);
+                            if (i % 4 == 1) {
+                                arr2[i] = new Short((short) i);
+                            } else {
+                                arr2[i] = new Short( (short) -i);
+                            }
+                            break;
+                    }
+                }
+            }
+        }
+    }
+
+    public static class ObjStateHeterogeneousAllEq extends ObjStateHeterogeneous {
+        @Setup
+        public void setup() {
+            setup(0);
+        }
+    }
+
+    public static class ObjStateHeterogeneousAllNeq extends ObjStateHeterogeneous {
+        @Setup
+        public void setup() {
+            setup(1);
+        }
+    }
+
+    public static class ObjStateHeterogeneousEqNeq extends ObjStateHeterogeneous {
+        @Setup
+        public void setup() {
+            setup(2);
+        }
+    }
+
+    @State(Scope.Thread)
+    public static class ObjStateNumeric {
+        Object[] arr1, arr2;
+
+        @Setup
+        public void setup() {
+            arr1 = new Object[SIZE];
+            arr2 = new Object[SIZE];
+
+            for (int i = 0; i < SIZE; i++) {
+                switch (i % 6) {
+                    case 0:
+                        arr1[i] = new Integer(i);
+                        arr2[i] = new Integer(i);
+                        break;
+                    case 1:
+                        arr1[i] = new Integer(i);
+                        arr2[i] = new Integer(-i);
+                        break;
+                    case 2:
+                        arr1[i] = new Integer(i);
+                        arr2[i] = new Short((short)i);
+                        break;
+                    case 3:
+                        arr1[i] = new Short((short)i);
+                        arr2[i] = new Integer(i);
+                        break;
+                    case 4:
+                        arr1[i] = new Short((short)i);
+                        arr2[i] = new Short((short)i);
+                        break;
+                    case 5:
+                        arr1[i] = new Short((short)i);
+                        arr2[i] = new Short((short)-i);
+                        break;
+                }
+            }
+        }
+    }
+
+    static value class CustomShort {
+        short s;
+        CustomShort(int s) {
+            this.s = (short)s;
+        }
+    }
+    static value class CustomChar {
+        char c;
+        CustomChar(int c) {
+            this.c = (char)c;
+        }
+    }
+    @State(Scope.Thread)
+    public static class ObjStateSingleField {
+        Object[] arr1, arr2;
+
+        @Setup
+        public void setup() {
+            arr1 = new Object[SIZE];
+            arr2 = new Object[SIZE];
+
+            for (int i = 0; i < SIZE; i++) {
+                switch (i % 6) {
+                    case 0:
+                        arr1[i] = new CustomShort(i);
+                        arr2[i] = new CustomShort(i);
+                        break;
+                    case 1:
+                        arr1[i] = new CustomShort(i);
+                        arr2[i] = new CustomShort(-i);
+                        break;
+                    case 2:
+                        arr1[i] = new CustomShort(i);
+                        arr2[i] = new CustomChar(i);
+                        break;
+                    case 3:
+                        arr1[i] = new CustomChar(i);
+                        arr2[i] = new CustomShort(i);
+                        break;
+                    case 4:
+                        arr1[i] = new CustomChar(i);
+                        arr2[i] = new CustomChar(i);
+                        break;
+                    case 5:
+                        arr1[i] = new CustomChar(i);
+                        arr2[i] = new CustomChar(-i);
+                        break;
+                }
+            }
+        }
+    }
+
+    static value class ShortByte {
+        short s;
+        byte b;
+        ShortByte(int s, int b) {
+            this.s = (short)s;
+            this.b = (byte)b;
+        }
+    }
+    static value class ByteByte {
+        byte b1;
+        byte b2;
+        ByteByte(int b1, int b2) {
+            this.b1 = (byte)b1;
+            this.b2 = (byte)b2;
+        }
+    }
+    @State(Scope.Thread)
+    public static class ObjStateMultiField {
+        Object[] arr1, arr2;
+
+        @Setup
+        public void setup() {
+            arr1 = new Object[SIZE];
+            arr2 = new Object[SIZE];
+
+            for (int i = 0; i < SIZE; i++) {
+                switch (i % 6) {
+                    case 0:
+                        arr1[i] = new ShortByte(i, i);
+                        arr2[i] = new ShortByte(i, i);
+                        break;
+                    case 1:
+                        arr1[i] = new ShortByte(i, i);
+                        arr2[i] = new ShortByte(i, 0);
+                        break;
+                    case 2:
+                        arr1[i] = new ShortByte(i, 0);
+                        arr2[i] = new ByteByte(i, 0);
+                        break;
+                    case 3:
+                        arr1[i] = new ByteByte(i, i);
+                        arr2[i] = new ShortByte(i, 0);
+                        break;
+                    case 4:
+                        arr1[i] = new ByteByte(i, i);
+                        arr2[i] = new ByteByte(i, i);
+                        break;
+                    case 5:
+                        arr1[i] = new ByteByte(i, i);
+                        arr2[i] = new ByteByte(i, 0);
+                        break;
+                }
+            }
+        }
+    }
+
+    static value class TooBigLongInt {
+        long first;
+        int second;
+        TooBigLongInt(long first, int second) {
+            this.first = first;
+            this.second = second;
+        }
+    }
+    static value class TooBigLongLong {
+        long first;
+        long second;
+        TooBigLongLong(long first, long second) {
+            this.first = first;
+            this.second = second;
+        }
+    }
+    @State(Scope.Thread)
+    public static class ObjStateTooBig {
+        Object[] arr1, arr2;
+
+        @Setup
+        public void setup() {
+            arr1 = new Object[SIZE];
+            arr2 = new Object[SIZE];
+
+            for (int i = 0; i < SIZE; i++) {
+                switch (i % 6) {
+                    case 0:
+                        arr1[i] = new TooBigLongInt(i, i);
+                        arr2[i] = new TooBigLongInt(i, i);
+                        break;
+                    case 1:
+                        arr1[i] = new TooBigLongInt(i, i);
+                        arr2[i] = new TooBigLongInt(i, 0);
+                        break;
+                    case 2:
+                        arr1[i] = new TooBigLongInt(i, 0);
+                        arr2[i] = new TooBigLongLong(i, 0);
+                        break;
+                    case 3:
+                        arr1[i] = new TooBigLongLong(i, i);
+                        arr2[i] = new TooBigLongInt(i, 0);
+                        break;
+                    case 4:
+                        arr1[i] = new TooBigLongLong(i, i);
+                        arr2[i] = new TooBigLongLong(i, i);
+                        break;
+                    case 5:
+                        arr1[i] = new TooBigLongLong(i, i);
+                        arr2[i] = new TooBigLongLong(i, 0);
+                        break;
+                }
+            }
+        }
+    }
+
+    static value class WithOopString {
+        String s;
+        WithOopString(String s) {
+            this.s = s;
+        }
+    }
+    static value class WithOopArray {
+        Integer[] s;
+        WithOopArray(int i) {
+            if (i % 4 == 0) {
+                this.s = null;
+            } else {
+                this.s = new Integer[]{i};
+            }
+        }
+    }
+    @State(Scope.Thread)
+    public static class ObjStateWithOop {
+        Object[] arr1, arr2;
+
+        @Setup
+        public void setup() {
+            arr1 = new Object[SIZE];
+            arr2 = new Object[SIZE];
+
+            for (int i = 0; i < SIZE; i++) {
+                switch (i % 6) {
+                    case 0:
+                        arr1[i] = new WithOopString(String.valueOf(i));
+                        arr2[i] = new WithOopString(String.valueOf(i));
+                        break;
+                    case 1:
+                        arr1[i] = new WithOopString(String.valueOf(i));
+                        arr2[i] = new WithOopString(String.valueOf(-i));
+                        break;
+                    case 2:
+                        arr1[i] = new WithOopString(String.valueOf(i));
+                        arr2[i] = new WithOopArray(i);
+                        break;
+                    case 3:
+                        arr1[i] = new WithOopArray(i);
+                        arr2[i] = new WithOopString(String.valueOf(i));
+                        break;
+                    case 4:
+                        arr1[i] = new WithOopArray(i);
+                        arr2[i] = new WithOopArray(i);
+                        break;
+                    case 5:
+                        arr1[i] = new WithOopArray(i);
+                        arr2[i] = new WithOopArray(-i);
+                        break;
+                }
+            }
+        }
+    }
+
+    static value class Empty {
+    }
+    @State(Scope.Thread)
+    public static class ObjStateEmpty {
+        Object[] arr1, arr2;
+
+        @Setup
+        public void setup() {
+            arr1 = new Object[SIZE];
+            arr2 = new Object[SIZE];
+
+            for (int i = 0; i < SIZE; i++) {
+                arr1[i] = new Empty();
+                arr2[i] = new Empty();
+            }
+        }
+    }
+    static value class OtherEmpty {
+    }
+    @State(Scope.Thread)
+    public static class ObjStateHeterogeneousEmpty {
+        Object[] arr1, arr2;
+
+        @Setup
+        public void setup() {
+            arr1 = new Object[SIZE];
+            arr2 = new Object[SIZE];
+
+            for (int i = 0; i < SIZE; i++) {
+                switch (i % 4) {
+                    case 0:
+                        arr1[i] = new Empty();
+                        arr2[i] = new Empty();
+                        break;
+                    case 1:
+                        arr1[i] = new Empty();
+                        arr2[i] = new OtherEmpty();
+                        break;
+                    case 2:
+                        arr1[i] = new OtherEmpty();
+                        arr2[i] = new Empty();
+                        break;
+                    case 3:
+                        arr1[i] = new OtherEmpty();
+                        arr2[i] = new OtherEmpty();
+                        break;
+                }
+            }
+        }
+    }
+
+    @State(Scope.Thread)
+    public static class ObjStateIdentity {
+        Object[] arr1, arr2;
+
+        @Setup
+        public void setup() {
+            arr1 = new Object[SIZE];
+            arr2 = new Object[SIZE];
+
+            for (int i = 0; i < SIZE; i++) {
+                switch (i % 6) {
+                    case 0:
+                        arr1[i] = String.valueOf(i);
+                        arr2[i] = String.valueOf(i);
+                        break;
+                    case 1:
+                        arr1[i] = String.valueOf(i);
+                        arr2[i] = String.valueOf(-i);
+                        break;
+                    case 2:
+                        arr1[i] = String.valueOf(i);
+                        arr2[i] = new int[]{i};
+                        break;
+                    case 3:
+                        arr1[i] = new int[]{i};
+                        arr2[i] = String.valueOf(i);
+                        break;
+                    case 4:
+                        arr1[i] = new int[]{i};
+                        arr2[i] = new int[]{i};
+                        break;
+                    case 5:
+                        arr1[i] = new int[]{i};
+                        arr2[i] = new int[]{-i};
+                        break;
+                }
+            }
+        }
+    }
+
+    @State(Scope.Thread)
+    public static class ObjStateBigMix {
+        Object[] arr1, arr2;
+
+        @Setup
+        public void setup() {
+            arr1 = new Object[SIZE];
+            arr2 = new Object[SIZE];
+
+            for (int i = 0; i < SIZE; i++) {
+                switch (i % 11) {
+                    case 0:
+                        arr1[i] = new Integer(i);
+                        arr2[i] = new Integer(i);
+                        break;
+                    case 1:
+                        arr1[i] = new Integer(i);
+                        arr2[i] = new Integer(-i);
+                        break;
+                    case 2:
+                        arr1[i] = new Integer(i);
+                        arr2[i] = String.valueOf(i);
+                        break;
+                    case 3:
+                        arr1[i] = new TooBigLongInt(i, 0);
+                        arr2[i] = new Integer(i);
+                        break;
+                    case 4:
+                        arr1[i] = String.valueOf(i);
+                        arr2[i] = String.valueOf(i);
+                        break;
+                    case 5:
+                        arr1[i] = String.valueOf(-i);
+                        arr2[i] = String.valueOf(i);
+                        break;
+                    case 6:
+                        arr1[i] = new TooBigLongInt(i, 0);
+                        arr2[i] = new TooBigLongInt(i, 0);
+                        break;
+                    case 7:
+                        arr1[i] = String.valueOf(i);
+                        arr2[i] = null;
+                        break;
+                    case 8:
+                        arr1[i] = null;
+                        arr2[i] = new Integer(i);
+                        break;
+                    case 9:
+                        arr1[i] = null;
+                        arr2[i] = new TooBigLongInt(i, 0);
+                        break;
+                    case 10:
+                        arr1[i] = null;
+                        arr2[i] = null;
+                        break;
+                }
+            }
+        }
+    }
+}