--- old/test/jdk/jdk/incubator/vector/benchmark/src/main/java/benchmark/jdk/incubator/vector/Short512Vector.java 2019-04-16 10:47:12.159833200 -0700 +++ new/test/jdk/jdk/incubator/vector/benchmark/src/main/java/benchmark/jdk/incubator/vector/Short512Vector.java 2019-04-16 10:47:11.706047400 -0700 @@ -24,8 +24,9 @@ package benchmark.jdk.incubator.vector; import jdk.incubator.vector.Vector; -import jdk.incubator.vector.Vector.Shape; -import jdk.incubator.vector.Vector.Species; +import jdk.incubator.vector.VectorShape; +import jdk.incubator.vector.VectorSpecies; +import jdk.incubator.vector.VectorShuffle; import jdk.incubator.vector.ShortVector; import java.util.concurrent.TimeUnit; @@ -42,7 +43,7 @@ @Measurement(iterations = 5, time = 1) @Fork(value = 1, jvmArgsPrepend = {"--add-modules=jdk.incubator.vector"}) public class Short512Vector extends AbstractVectorBenchmark { - static final Species SPECIES = ShortVector.SPECIES_512; + static final VectorSpecies SPECIES = ShortVector.SPECIES_512; static final int INVOC_COUNT = 1; // get rid of outer loop @@ -108,7 +109,7 @@ short[] b = fb.apply(SPECIES.length()); short[] r = fr.apply(SPECIES.length()); boolean[] mask = fm.apply(SPECIES.length()); - Vector.Mask vmask = ShortVector.maskFromValues(SPECIES, mask); + VectorMask vmask = VectorMask.fromValues(SPECIES, mask); for (int ic = 0; ic < INVOC_COUNT; ic++) { for (int i = 0; i < a.length; i += SPECIES.length()) { @@ -144,7 +145,7 @@ short[] b = fb.apply(SPECIES.length()); short[] r = fr.apply(SPECIES.length()); boolean[] mask = fm.apply(SPECIES.length()); - Vector.Mask vmask = ShortVector.maskFromValues(SPECIES, mask); + VectorMask vmask = VectorMask.fromValues(SPECIES, mask); for (int ic = 0; ic < INVOC_COUNT; ic++) { for (int i = 0; i < a.length; i += SPECIES.length()) { @@ -182,7 +183,7 @@ short[] b = fb.apply(SPECIES.length()); short[] r = fr.apply(SPECIES.length()); boolean[] mask = fm.apply(SPECIES.length()); - Vector.Mask vmask = ShortVector.maskFromValues(SPECIES, mask); + VectorMask vmask = VectorMask.fromValues(SPECIES, mask); for (int ic = 0; ic < INVOC_COUNT; ic++) { for (int i = 0; i < a.length; i += SPECIES.length()) { @@ -221,7 +222,7 @@ short[] b = fb.apply(SPECIES.length()); short[] r = fr.apply(SPECIES.length()); boolean[] mask = fm.apply(SPECIES.length()); - Vector.Mask vmask = ShortVector.maskFromValues(SPECIES, mask); + VectorMask vmask = VectorMask.fromValues(SPECIES, mask); for (int ic = 0; ic < INVOC_COUNT; ic++) { for (int i = 0; i < a.length; i += SPECIES.length()) { @@ -261,7 +262,7 @@ short[] b = fb.apply(SPECIES.length()); short[] r = fr.apply(SPECIES.length()); boolean[] mask = fm.apply(SPECIES.length()); - Vector.Mask vmask = ShortVector.maskFromValues(SPECIES, mask); + VectorMask vmask = VectorMask.fromValues(SPECIES, mask); for (int ic = 0; ic < INVOC_COUNT; ic++) { for (int i = 0; i < a.length; i += SPECIES.length()) { @@ -301,7 +302,7 @@ short[] b = fb.apply(SPECIES.length()); short[] r = fr.apply(SPECIES.length()); boolean[] mask = fm.apply(SPECIES.length()); - Vector.Mask vmask = ShortVector.maskFromValues(SPECIES, mask); + VectorMask vmask = VectorMask.fromValues(SPECIES, mask); for (int ic = 0; ic < INVOC_COUNT; ic++) { for (int i = 0; i < a.length; i += SPECIES.length()) { @@ -358,7 +359,7 @@ short[] b = fb.apply(SPECIES.length()); short[] r = fr.apply(SPECIES.length()); boolean[] mask = fm.apply(SPECIES.length()); - Vector.Mask vmask = ShortVector.maskFromValues(SPECIES, mask); + VectorMask vmask = VectorMask.fromValues(SPECIES, mask); for (int ic = 0; ic < INVOC_COUNT; ic++) { for (int i = 0; i < a.length; i += SPECIES.length()) { @@ -396,7 +397,7 @@ short[] b = fb.apply(SPECIES.length()); short[] r = fr.apply(SPECIES.length()); boolean[] mask = fm.apply(SPECIES.length()); - Vector.Mask vmask = ShortVector.maskFromValues(SPECIES, mask); + VectorMask vmask = VectorMask.fromValues(SPECIES, mask); for (int ic = 0; ic < INVOC_COUNT; ic++) { for (int i = 0; i < a.length; i += SPECIES.length()) { @@ -434,7 +435,7 @@ short[] b = fb.apply(SPECIES.length()); short[] r = fr.apply(SPECIES.length()); boolean[] mask = fm.apply(SPECIES.length()); - Vector.Mask vmask = ShortVector.maskFromValues(SPECIES, mask); + VectorMask vmask = VectorMask.fromValues(SPECIES, mask); for (int ic = 0; ic < INVOC_COUNT; ic++) { for (int i = 0; i < a.length; i += SPECIES.length()) { @@ -600,7 +601,7 @@ for (int ic = 0; ic < INVOC_COUNT; ic++) { for (int i = 0; i < mask.length; i += SPECIES.length()) { - Vector.Mask vmask = ShortVector.maskFromArray(SPECIES, mask, i); + VectorMask vmask = VectorMask.fromArray(SPECIES, mask, i); r[i] = vmask.anyTrue(); } } @@ -617,7 +618,7 @@ for (int ic = 0; ic < INVOC_COUNT; ic++) { for (int i = 0; i < mask.length; i += SPECIES.length()) { - Vector.Mask vmask = ShortVector.maskFromArray(SPECIES, mask, i); + VectorMask vmask = VectorMask.fromArray(SPECIES, mask, i); r[i] = vmask.allTrue(); } } @@ -646,13 +647,13 @@ short[] a = fa.apply(size); short[] b = fb.apply(size); boolean[] ms = fm.apply(size); - Vector.Mask m = ShortVector.maskFromArray(SPECIES, ms, 0); + VectorMask m = VectorMask.maskFromArray(SPECIES, ms, 0); for (int ic = 0; ic < INVOC_COUNT; ic++) { for (int i = 0; i < a.length; i += SPECIES.length()) { ShortVector av = ShortVector.fromArray(SPECIES, a, i); ShortVector bv = ShortVector.fromArray(SPECIES, b, i); - Vector.Mask mv = av.lessThan(bv); + VectorMask mv = av.lessThan(bv); m = m.and(mv); // accumulate results, so JIT can't eliminate relevant computations } @@ -666,13 +667,13 @@ short[] a = fa.apply(size); short[] b = fb.apply(size); boolean[] ms = fm.apply(size); - Vector.Mask m = ShortVector.maskFromArray(SPECIES, ms, 0); + VectorMask m = VectorMask.maskFromArray(SPECIES, ms, 0); for (int ic = 0; ic < INVOC_COUNT; ic++) { for (int i = 0; i < a.length; i += SPECIES.length()) { ShortVector av = ShortVector.fromArray(SPECIES, a, i); ShortVector bv = ShortVector.fromArray(SPECIES, b, i); - Vector.Mask mv = av.greaterThan(bv); + VectorMask mv = av.greaterThan(bv); m = m.and(mv); // accumulate results, so JIT can't eliminate relevant computations } @@ -686,13 +687,13 @@ short[] a = fa.apply(size); short[] b = fb.apply(size); boolean[] ms = fm.apply(size); - Vector.Mask m = ShortVector.maskFromArray(SPECIES, ms, 0); + VectorMask m = VectorMask.maskFromArray(SPECIES, ms, 0); for (int ic = 0; ic < INVOC_COUNT; ic++) { for (int i = 0; i < a.length; i += SPECIES.length()) { ShortVector av = ShortVector.fromArray(SPECIES, a, i); ShortVector bv = ShortVector.fromArray(SPECIES, b, i); - Vector.Mask mv = av.equal(bv); + VectorMask mv = av.equal(bv); m = m.and(mv); // accumulate results, so JIT can't eliminate relevant computations } @@ -706,13 +707,13 @@ short[] a = fa.apply(size); short[] b = fb.apply(size); boolean[] ms = fm.apply(size); - Vector.Mask m = ShortVector.maskFromArray(SPECIES, ms, 0); + VectorMask m = VectorMask.maskFromArray(SPECIES, ms, 0); for (int ic = 0; ic < INVOC_COUNT; ic++) { for (int i = 0; i < a.length; i += SPECIES.length()) { ShortVector av = ShortVector.fromArray(SPECIES, a, i); ShortVector bv = ShortVector.fromArray(SPECIES, b, i); - Vector.Mask mv = av.notEqual(bv); + VectorMask mv = av.notEqual(bv); m = m.and(mv); // accumulate results, so JIT can't eliminate relevant computations } @@ -726,13 +727,13 @@ short[] a = fa.apply(size); short[] b = fb.apply(size); boolean[] ms = fm.apply(size); - Vector.Mask m = ShortVector.maskFromArray(SPECIES, ms, 0); + VectorMask m = VectorMask.maskFromArray(SPECIES, ms, 0); for (int ic = 0; ic < INVOC_COUNT; ic++) { for (int i = 0; i < a.length; i += SPECIES.length()) { ShortVector av = ShortVector.fromArray(SPECIES, a, i); ShortVector bv = ShortVector.fromArray(SPECIES, b, i); - Vector.Mask mv = av.lessThanEq(bv); + VectorMask mv = av.lessThanEq(bv); m = m.and(mv); // accumulate results, so JIT can't eliminate relevant computations } @@ -746,13 +747,13 @@ short[] a = fa.apply(size); short[] b = fb.apply(size); boolean[] ms = fm.apply(size); - Vector.Mask m = ShortVector.maskFromArray(SPECIES, ms, 0); + VectorMask m = VectorMask.maskFromArray(SPECIES, ms, 0); for (int ic = 0; ic < INVOC_COUNT; ic++) { for (int i = 0; i < a.length; i += SPECIES.length()) { ShortVector av = ShortVector.fromArray(SPECIES, a, i); ShortVector bv = ShortVector.fromArray(SPECIES, b, i); - Vector.Mask mv = av.greaterThanEq(bv); + VectorMask mv = av.greaterThanEq(bv); m = m.and(mv); // accumulate results, so JIT can't eliminate relevant computations } @@ -767,7 +768,7 @@ short[] b = fb.apply(SPECIES.length()); short[] r = fr.apply(SPECIES.length()); boolean[] mask = fm.apply(SPECIES.length()); - Vector.Mask vmask = ShortVector.maskFromValues(SPECIES, mask); + VectorMask vmask = VectorMask.fromValues(SPECIES, mask); for (int ic = 0; ic < INVOC_COUNT; ic++) { for (int i = 0; i < a.length; i += SPECIES.length()) { @@ -789,7 +790,7 @@ for (int ic = 0; ic < INVOC_COUNT; ic++) { for (int i = 0; i < a.length; i += SPECIES.length()) { ShortVector av = ShortVector.fromArray(SPECIES, a, i); - av.rearrange(ShortVector.shuffleFromArray(SPECIES, order, i)).intoArray(r, i); + av.rearrange(VectorShuffle.fromArray(SPECIES, order, i)).intoArray(r, i); } } @@ -992,7 +993,7 @@ short[] a = fa.apply(SPECIES.length()); short[] r = fr.apply(SPECIES.length()); boolean[] mask = fm.apply(SPECIES.length()); - Vector.Mask vmask = ShortVector.maskFromValues(SPECIES, mask); + VectorMask vmask = VectorMask.fromValues(SPECIES, mask); for (int ic = 0; ic < INVOC_COUNT; ic++) { for (int i = 0; i < a.length; i += SPECIES.length()) { @@ -1024,7 +1025,7 @@ short[] a = fa.apply(SPECIES.length()); short[] r = fr.apply(SPECIES.length()); boolean[] mask = fm.apply(SPECIES.length()); - Vector.Mask vmask = ShortVector.maskFromValues(SPECIES, mask); + VectorMask vmask = VectorMask.fromValues(SPECIES, mask); for (int ic = 0; ic < INVOC_COUNT; ic++) { for (int i = 0; i < a.length; i += SPECIES.length()) { @@ -1059,7 +1060,7 @@ short[] a = fa.apply(SPECIES.length()); short[] r = fr.apply(SPECIES.length()); boolean[] mask = fm.apply(SPECIES.length()); - Vector.Mask vmask = ShortVector.maskFromValues(SPECIES, mask); + VectorMask vmask = VectorMask.fromValues(SPECIES, mask); for (int ic = 0; ic < INVOC_COUNT; ic++) { for (int i = 0; i < a.length; i += SPECIES.length()) {