Skip to content

Apache Lucene open-source search software

migrate all vectorbench methods to lucene (#12667)

Robert Muira4ff129de806
diff --git a/gradle/help.gradle b/gradle/help.gradle
index 27078b3b843..5c01a68fd38 100644
--- a/gradle/help.gradle
+++ b/gradle/help.gradle
@@ -27,7 +27,7 @@ configure(rootProject) {
["ForbiddenApis", "help/forbiddenApis.txt", "How to add/apply rules for forbidden APIs."],
["LocalSettings", "help/localSettings.txt", "Local settings, overrides and build performance tweaks."],
["Regeneration", "help/regeneration.txt", "How to refresh generated and derived resources."],
- ["Jmh", "lucene/benchmark-jmh/README.txt", "JMH micro-benchmarks."],
+ ["Jmh", "help/jmh.txt", "JMH micro-benchmarks."],
["Git", "help/git.txt", "Git assistance and guides."],
["IDEs", "help/IDEs.txt", "IDE support."],
["Publishing", "help/publishing.txt", "Maven and other artifact publishing, signing, etc."],
diff --git a/help/jmh.txt b/help/jmh.txt
index e69de29bb2d..d2eaee2753e 100644
--- a/help/jmh.txt
+++ b/help/jmh.txt
@@ -0,0 +1,51 @@
+benchmarks
+==========
+
+The :lucene:benchmark-jmh module contains can be used to compile
+and execute JMH (https://github.com/openjdk/jmh) micro-benchmarks.
+
+Look at existing classes and JMH documentation for inspiration on how
+to write good micro-benchmarks.
+
+build
+=====
+
+To compile the project and prepare JMH launcher, run:
+
+gradlew :lucene:benchmark-jmh:assemble
+
+The above target will display exact commands to execute JMH from
+command line.
+
+run
+===
+
+java --module-path lucene/benchmark-jmh/build/benchmarks --module org.apache.lucene.benchmark.jmh
+
+You can pass any JMH options to the above command, for example:
+
+ -h displays verbose help for all options
+ -l list available benchmarks
+ -lp list benchmarks that pass the filter and their parameters
+ -prof perfasm use perfasm profiler to see assembly
+ -p size=1024 pass "size=1024" parameter to benchmark
+ regexp execute all benchmark containing regexp
+
+Here is an example running a targeted benchmark:
+
+java --module-path lucene/benchmark-jmh/build/benchmarks --module org.apache.lucene.benchmark.jmh VectorUtilBenchmark.binaryCosine -p size=1024
+
+Or running all methods and sizes of VectorUtilBenchmark
+
+java --module-path lucene/benchmark-jmh/build/benchmarks --module org.apache.lucene.benchmark.jmh VectorUtilBenchmark
+
+
+hsdis setup
+===========
+
+In order to see disassembled instructions and not just binary instructions when using '-prof perfasm':
+
+ $ git clone --depth 1 https://github.com/openjdk/jdk/
+ $ curl -f https://ftp.gnu.org/gnu/binutils/binutils-2.38.tar.gz | tar -zxf -
+ $ (cd jdk && bash ./configure --with-hsdis=binutils --with-binutils-src=../binutils-2.38 && make build-hsdis)
+ $ cp jdk/build/linux-x86_64-server-release/support/hsdis/hsdis-amd64.so $JAVA_HOME/lib/server
diff --git a/lucene/benchmark-jmh/README.txt b/lucene/benchmark-jmh/README.txt
deleted file mode 100644
index d3c6638eb2f..00000000000
--- a/lucene/benchmark-jmh/README.txt
+++ /dev/null
@@ -1,29 +0,0 @@
-The :lucene:benchmark-jmh module contains can be used to compile
-and execute JMH (https://github.com/openjdk/jmh) micro-benchmarks.
-
-Look at existing classes and JMH documentation for inspiration on how
-to write good micro-benchmarks.
-
-To compile the project and prepare JMH launcher, run:
-
-gradlew :lucene:benchmark-jmh:assemble
-
-The above target will display exact commands to execute JMH from
-command line, for example:
-
-java --module-path lucene\benchmark-jmh\build\benchmarks --module org.apache.lucene.benchmark.jmh
-
-You can pass any JMH options to the above command, for example:
-
- -h displays verbose help for all options
- -l list available benchmarks
- -lp list benchmarks that pass the filter and their parameters
- regexp execute all benchmark containing regexp
-
-Here is an example running a single benchmark:
-
-java --module-path lucene\benchmark-jmh\build\benchmarks --module org.apache.lucene.benchmark.jmh org.apache.lucene.benchmark.jmh.BinaryCosineBenchmark.cosineDistanceNew
-
-Or running all of BinaryCosineBenchmark
-
-java --module-path lucene\benchmark-jmh\build\benchmarks --module org.apache.lucene.benchmark.jmh org.apache.lucene.benchmark.jmh.BinaryCosineBenchmark
\ No newline at end of file
diff --git a/lucene/benchmark-jmh/build.gradle b/lucene/benchmark-jmh/build.gradle
index 4c0008da128..4a35d998dc9 100644
--- a/lucene/benchmark-jmh/build.gradle
+++ b/lucene/benchmark-jmh/build.gradle
@@ -32,7 +32,6 @@ dependencies {
// Exclude JMH-generated files and certain classes that require incubating classes
// from forbiddenapis validation.
tasks.matching { it.name == "forbiddenApisMain" }.configureEach {
- failOnMissingClasses = false
patternSet.exclude([
"**/jmh_generated/**"
])
diff --git a/lucene/benchmark-jmh/src/java/module-info.java b/lucene/benchmark-jmh/src/java/module-info.java
index 60900388dee..c212a42fb7e 100644
--- a/lucene/benchmark-jmh/src/java/module-info.java
+++ b/lucene/benchmark-jmh/src/java/module-info.java
@@ -18,7 +18,6 @@
/** Lucene JMH benchmarks. */
module org.apache.lucene.benchmark.jmh {
requires jmh.core;
- requires jdk.incubator.vector;
requires jdk.unsupported;
requires org.apache.lucene.core;
diff --git a/lucene/benchmark-jmh/src/java/org/apache/lucene/benchmark/jmh/BinaryCosineBenchmark.java b/lucene/benchmark-jmh/src/java/org/apache/lucene/benchmark/jmh/BinaryCosineBenchmark.java
deleted file mode 100644
index f58d661473e..00000000000
--- a/lucene/benchmark-jmh/src/java/org/apache/lucene/benchmark/jmh/BinaryCosineBenchmark.java
+++ /dev/null
@@ -1,282 +0,0 @@
-/*
- * Licensed to the Apache Software Foundation (ASF) under one or more
- * contributor license agreements. See the NOTICE file distributed with
- * this work for additional information regarding copyright ownership.
- * The ASF licenses this file to You under the Apache License, Version 2.0
- * (the "License"); you may not use this file except in compliance with
- * the License. You may obtain a copy of the License at
- *
- * http://www.apache.org/licenses/LICENSE-2.0
- *
- * Unless required by applicable law or agreed to in writing, software
- * distributed under the License is distributed on an "AS IS" BASIS,
- * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
- * See the License for the specific language governing permissions and
- * limitations under the License.
- */
-package org.apache.lucene.benchmark.jmh;
-
-import java.util.concurrent.ThreadLocalRandom;
-import java.util.concurrent.TimeUnit;
-import jdk.incubator.vector.ByteVector;
-import jdk.incubator.vector.IntVector;
-import jdk.incubator.vector.ShortVector;
-import jdk.incubator.vector.Vector;
-import jdk.incubator.vector.VectorOperators;
-import jdk.incubator.vector.VectorShape;
-import jdk.incubator.vector.VectorSpecies;
-import org.apache.lucene.util.VectorUtil;
-import org.openjdk.jmh.annotations.*;
-
-@BenchmarkMode(Mode.Throughput)
-@OutputTimeUnit(TimeUnit.MICROSECONDS)
-@State(Scope.Benchmark)
-@Warmup(iterations = 3, time = 3)
-@Measurement(iterations = 5, time = 3)
-@Fork(
- value = 1,
- jvmArgsPrepend = {"--add-modules=jdk.incubator.vector"})
-public class BinaryCosineBenchmark {
-
- private byte[] a;
- private byte[] b;
-
- @Param({"1", "128", "207", "256", "300", "512", "702", "1024"})
- // @Param({"1", "4", "6", "8", "13", "16", "25", "32", "64", "100" })
- // @Param({"1024"})
- // @Param({"16", "32", "64"})
- int size;
-
- @Setup(Level.Trial)
- public void init() {
- a = new byte[size];
- b = new byte[size];
- ThreadLocalRandom.current().nextBytes(a);
- ThreadLocalRandom.current().nextBytes(b);
- if (cosineDistanceNew() != cosineDistanceOld()) {
- throw new RuntimeException("New is wrong");
- }
- }
-
- static final VectorSpecies<Byte> PREFERRED_BYTE_SPECIES;
- static final VectorSpecies<Short> PREFERRED_SHORT_SPECIES;
-
- static {
- if (IntVector.SPECIES_PREFERRED.vectorBitSize() >= 256) {
- PREFERRED_BYTE_SPECIES =
- ByteVector.SPECIES_MAX.withShape(
- VectorShape.forBitSize(IntVector.SPECIES_PREFERRED.vectorBitSize() >> 2));
- PREFERRED_SHORT_SPECIES =
- ShortVector.SPECIES_MAX.withShape(
- VectorShape.forBitSize(IntVector.SPECIES_PREFERRED.vectorBitSize() >> 1));
- } else {
- PREFERRED_BYTE_SPECIES = null;
- PREFERRED_SHORT_SPECIES = null;
- }
- }
-
- private static final boolean IS_AMD64_WITHOUT_AVX2 =
- System.getProperty("os.arch").equals("amd64")
- && IntVector.SPECIES_PREFERRED.vectorBitSize() < 256;
-
- @Benchmark
- public float cosineDistanceVectorUtil() {
- return VectorUtil.cosine(a, b);
- }
-
- @Benchmark
- public float cosineDistanceNewNew() {
- int i = 0;
- int sum = 0;
- int norm1 = 0;
- int norm2 = 0;
- final int vectorSize = IntVector.SPECIES_PREFERRED.vectorBitSize();
- // only vectorize if we'll at least enter the loop a single time, and we have at least 128-bit
- // vectors
- if (a.length >= 16 && vectorSize >= 128 && IS_AMD64_WITHOUT_AVX2 == false) {
- if (vectorSize >= 256) {
- // optimized 256/512 bit implementation, processes 8/16 bytes at a time
- int upperBound = PREFERRED_BYTE_SPECIES.loopBound(a.length);
- IntVector accSum = IntVector.zero(IntVector.SPECIES_PREFERRED);
- IntVector accNorm1 = IntVector.zero(IntVector.SPECIES_PREFERRED);
- IntVector accNorm2 = IntVector.zero(IntVector.SPECIES_PREFERRED);
- for (; i < upperBound; i += PREFERRED_BYTE_SPECIES.length()) {
- ByteVector va8 = ByteVector.fromArray(PREFERRED_BYTE_SPECIES, a, i);
- ByteVector vb8 = ByteVector.fromArray(PREFERRED_BYTE_SPECIES, b, i);
- Vector<Short> va16 = va8.convertShape(VectorOperators.B2S, PREFERRED_SHORT_SPECIES, 0);
- Vector<Short> vb16 = vb8.convertShape(VectorOperators.B2S, PREFERRED_SHORT_SPECIES, 0);
- Vector<Short> prod16 = va16.mul(vb16);
- Vector<Short> norm1_16 = va16.mul(va16);
- Vector<Short> norm2_16 = vb16.mul(vb16);
- Vector<Integer> prod32 =
- prod16.convertShape(VectorOperators.S2I, IntVector.SPECIES_PREFERRED, 0);
- Vector<Integer> norm1_32 =
- norm1_16.convertShape(VectorOperators.S2I, IntVector.SPECIES_PREFERRED, 0);
- Vector<Integer> norm2_32 =
- norm2_16.convertShape(VectorOperators.S2I, IntVector.SPECIES_PREFERRED, 0);
- accSum = accSum.add(prod32);
- accNorm1 = accNorm1.add(norm1_32);
- accNorm2 = accNorm2.add(norm2_32);
- }
- // reduce
- sum += accSum.reduceLanes(VectorOperators.ADD);
- norm1 += accNorm1.reduceLanes(VectorOperators.ADD);
- norm2 += accNorm2.reduceLanes(VectorOperators.ADD);
- } else {
- // 128-bit impl, which is tricky since we don't have SPECIES_32, it does "overlapping read"
- int upperBound = ByteVector.SPECIES_64.loopBound(a.length - ByteVector.SPECIES_64.length());
- IntVector accSum = IntVector.zero(IntVector.SPECIES_128);
- IntVector accNorm1 = IntVector.zero(IntVector.SPECIES_128);
- IntVector accNorm2 = IntVector.zero(IntVector.SPECIES_128);
- for (; i < upperBound; i += ByteVector.SPECIES_64.length() >> 1) {
- ByteVector va8 = ByteVector.fromArray(ByteVector.SPECIES_64, a, i);
- ByteVector vb8 = ByteVector.fromArray(ByteVector.SPECIES_64, b, i);
-
- // process first half only
- Vector<Short> va16 = va8.convert(VectorOperators.B2S, 0);
- Vector<Short> vb16 = vb8.convert(VectorOperators.B2S, 0);
- Vector<Short> norm1_16 = va16.mul(va16);
- Vector<Short> norm2_16 = vb16.mul(vb16);
- Vector<Short> prod16 = va16.mul(vb16);
-
- // sum into accumulators
- accNorm1 =
- accNorm1.add(norm1_16.convertShape(VectorOperators.S2I, IntVector.SPECIES_128, 0));
- accNorm2 =
- accNorm2.add(norm2_16.convertShape(VectorOperators.S2I, IntVector.SPECIES_128, 0));
- accSum = accSum.add(prod16.convertShape(VectorOperators.S2I, IntVector.SPECIES_128, 0));
- }
- // reduce
- sum += accSum.reduceLanes(VectorOperators.ADD);
- norm1 += accNorm1.reduceLanes(VectorOperators.ADD);
- norm2 += accNorm2.reduceLanes(VectorOperators.ADD);
- }
- }
-
- for (; i < a.length; i++) {
- byte elem1 = a[i];
- byte elem2 = b[i];
- sum += elem1 * elem2;
- norm1 += elem1 * elem1;
- norm2 += elem2 * elem2;
- }
- return (float) (sum / Math.sqrt((double) norm1 * (double) norm2));
- }
-
- @Benchmark
- public float cosineDistanceNew() {
- int i = 0;
- int sum = 0;
- int norm1 = 0;
- int norm2 = 0;
- final int vectorSize = IntVector.SPECIES_PREFERRED.vectorBitSize();
- // only vectorize if we'll at least enter the loop a single time, and we have at least 128-bit
- // vectors
- if (a.length >= 16 && vectorSize >= 128 && IS_AMD64_WITHOUT_AVX2 == false) {
- // acts like:
- // int sum = 0;
- // for (...) {
- // short difference = (short) (x[i] - y[i]);
- // sum += (int) difference * (int) difference;
- // }
- if (vectorSize >= 256) {
- // optimized 256/512 bit implementation, processes 8/16 bytes at a time
- int upperBound = PREFERRED_BYTE_SPECIES.loopBound(a.length);
- IntVector accSum = IntVector.zero(IntVector.SPECIES_PREFERRED);
- IntVector accNorm1 = IntVector.zero(IntVector.SPECIES_PREFERRED);
- IntVector accNorm2 = IntVector.zero(IntVector.SPECIES_PREFERRED);
- for (; i < upperBound; i += PREFERRED_BYTE_SPECIES.length()) {
- ByteVector va8 = ByteVector.fromArray(PREFERRED_BYTE_SPECIES, a, i);
- ByteVector vb8 = ByteVector.fromArray(PREFERRED_BYTE_SPECIES, b, i);
- Vector<Short> va16 = va8.convertShape(VectorOperators.B2S, PREFERRED_SHORT_SPECIES, 0);
- Vector<Short> vb16 = vb8.convertShape(VectorOperators.B2S, PREFERRED_SHORT_SPECIES, 0);
- Vector<Short> prod16 = va16.mul(vb16);
- Vector<Short> norm1_16 = va16.mul(va16);
- Vector<Short> norm2_16 = vb16.mul(vb16);
- Vector<Integer> prod32 =
- prod16.convertShape(VectorOperators.S2I, IntVector.SPECIES_PREFERRED, 0);
- Vector<Integer> norm1_32 =
- norm1_16.convertShape(VectorOperators.S2I, IntVector.SPECIES_PREFERRED, 0);
- Vector<Integer> norm2_32 =
- norm2_16.convertShape(VectorOperators.S2I, IntVector.SPECIES_PREFERRED, 0);
- accSum = accSum.add(prod32);
- accNorm1 = accNorm1.add(norm1_32);
- accNorm2 = accNorm2.add(norm2_32);
- }
- // reduce
- sum += accSum.reduceLanes(VectorOperators.ADD);
- norm1 += accNorm1.reduceLanes(VectorOperators.ADD);
- norm2 += accNorm2.reduceLanes(VectorOperators.ADD);
- } else {
- // 128-bit implementation, which must "split up" vectors due to widening conversions
- int upperBound = ByteVector.SPECIES_64.loopBound(a.length);
- IntVector accSum1 = IntVector.zero(IntVector.SPECIES_128);
- IntVector accSum2 = IntVector.zero(IntVector.SPECIES_128);
- IntVector accNorm1_1 = IntVector.zero(IntVector.SPECIES_128);
- IntVector accNorm1_2 = IntVector.zero(IntVector.SPECIES_128);
- IntVector accNorm2_1 = IntVector.zero(IntVector.SPECIES_128);
- IntVector accNorm2_2 = IntVector.zero(IntVector.SPECIES_128);
- for (; i < upperBound; i += ByteVector.SPECIES_64.length()) {
- ByteVector va8 = ByteVector.fromArray(ByteVector.SPECIES_64, a, i);
- ByteVector vb8 = ByteVector.fromArray(ByteVector.SPECIES_64, b, i);
- // expand each byte vector into short vector and perform multiplications
- Vector<Short> va16 = va8.convertShape(VectorOperators.B2S, ShortVector.SPECIES_128, 0);
- Vector<Short> vb16 = vb8.convertShape(VectorOperators.B2S, ShortVector.SPECIES_128, 0);
- Vector<Short> prod16 = va16.mul(vb16);
- Vector<Short> norm1_16 = va16.mul(va16);
- Vector<Short> norm2_16 = vb16.mul(vb16);
- // split each short vector into two int vectors and add
- Vector<Integer> prod32_1 =
- prod16.convertShape(VectorOperators.S2I, IntVector.SPECIES_128, 0);
- Vector<Integer> prod32_2 =
- prod16.convertShape(VectorOperators.S2I, IntVector.SPECIES_128, 1);
- Vector<Integer> norm1_32_1 =
- norm1_16.convertShape(VectorOperators.S2I, IntVector.SPECIES_128, 0);
- Vector<Integer> norm1_32_2 =
- norm1_16.convertShape(VectorOperators.S2I, IntVector.SPECIES_128, 1);
- Vector<Integer> norm2_32_1 =
- norm2_16.convertShape(VectorOperators.S2I, IntVector.SPECIES_128, 0);
- Vector<Integer> norm2_32_2 =
- norm2_16.convertShape(VectorOperators.S2I, IntVector.SPECIES_128, 1);
- accSum1 = accSum1.add(prod32_1);
- accSum2 = accSum2.add(prod32_2);
- accNorm1_1 = accNorm1_1.add(norm1_32_1);
- accNorm1_2 = accNorm1_2.add(norm1_32_2);
- accNorm2_1 = accNorm2_1.add(norm2_32_1);
- accNorm2_2 = accNorm2_2.add(norm2_32_2);
- }
- // reduce
- sum += accSum1.add(accSum2).reduceLanes(VectorOperators.ADD);
- norm1 += accNorm1_1.add(accNorm1_2).reduceLanes(VectorOperators.ADD);
- norm2 += accNorm2_1.add(accNorm2_2).reduceLanes(VectorOperators.ADD);
- }
- }
-
- for (; i < a.length; i++) {
- byte elem1 = a[i];
- byte elem2 = b[i];
- sum += elem1 * elem2;
- norm1 += elem1 * elem1;
- norm2 += elem2 * elem2;
- }
- return (float) (sum / Math.sqrt((double) norm1 * (double) norm2));
- }
-
- /** Returns the cosine similarity between the two vectors. */
- @Benchmark
- public float cosineDistanceOld() {
- // Note: this will not overflow if dim < 2^18, since max(byte * byte) = 2^14.
- int sum = 0;
- int norm1 = 0;
- int norm2 = 0;
-
- for (int i = 0; i < a.length; i++) {
- byte elem1 = a[i];
- byte elem2 = b[i];
- sum += elem1 * elem2;
- norm1 += elem1 * elem1;
- norm2 += elem2 * elem2;
- }
- return (float) (sum / Math.sqrt((double) norm1 * (double) norm2));
- }
-}
diff --git a/lucene/benchmark-jmh/src/java/org/apache/lucene/benchmark/jmh/VectorUtilBenchmark.java b/lucene/benchmark-jmh/src/java/org/apache/lucene/benchmark/jmh/VectorUtilBenchmark.java
new file mode 100644
index 00000000000..b130bc3422f
--- /dev/null
+++ b/lucene/benchmark-jmh/src/java/org/apache/lucene/benchmark/jmh/VectorUtilBenchmark.java
@@ -0,0 +1,141 @@
+/*
+ * Licensed to the Apache Software Foundation (ASF) under one or more
+ * contributor license agreements. See the NOTICE file distributed with
+ * this work for additional information regarding copyright ownership.
+ * The ASF licenses this file to You under the Apache License, Version 2.0
+ * (the "License"); you may not use this file except in compliance with
+ * the License. You may obtain a copy of the License at
+ *
+ * http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+package org.apache.lucene.benchmark.jmh;
+
+import java.util.concurrent.ThreadLocalRandom;
+import java.util.concurrent.TimeUnit;
+import org.apache.lucene.util.VectorUtil;
+import org.openjdk.jmh.annotations.*;
+
+@BenchmarkMode(Mode.Throughput)
+@OutputTimeUnit(TimeUnit.MICROSECONDS)
+@State(Scope.Benchmark)
+@Warmup(iterations = 3, time = 3)
+@Measurement(iterations = 5, time = 3)
+public class VectorUtilBenchmark {
+
+ private byte[] bytesA;
+ private byte[] bytesB;
+ private float[] floatsA;
+ private float[] floatsB;
+
+ @Param({"1", "128", "207", "256", "300", "512", "702", "1024"})
+ int size;
+
+ @Setup(Level.Trial)
+ public void init() {
+ ThreadLocalRandom random = ThreadLocalRandom.current();
+
+ // random byte arrays for binary methods
+ bytesA = new byte[size];
+ bytesB = new byte[size];
+ random.nextBytes(bytesA);
+ random.nextBytes(bytesB);
+
+ // random float arrays for float methods
+ floatsA = new float[size];
+ floatsB = new float[size];
+ for (int i = 0; i < size; ++i) {
+ floatsA[i] = random.nextFloat();
+ floatsB[i] = random.nextFloat();
+ }
+ }
+
+ @Benchmark
+ @Fork(value = 1)
+ public float binaryCosineScalar() {
+ return VectorUtil.cosine(bytesA, bytesB);
+ }
+
+ @Benchmark
+ @Fork(
+ value = 1,
+ jvmArgsPrepend = {"--add-modules=jdk.incubator.vector"})
+ public float binaryCosineVector() {
+ return VectorUtil.cosine(bytesA, bytesB);
+ }
+
+ @Benchmark
+ @Fork(value = 1)
+ public int binaryDotProductScalar() {
+ return VectorUtil.dotProduct(bytesA, bytesB);
+ }
+
+ @Benchmark
+ @Fork(
+ value = 1,
+ jvmArgsPrepend = {"--add-modules=jdk.incubator.vector"})
+ public int binaryDotProductVector() {
+ return VectorUtil.dotProduct(bytesA, bytesB);
+ }
+
+ @Benchmark
+ @Fork(value = 1)
+ public int binarySquareScalar() {
+ return VectorUtil.squareDistance(bytesA, bytesB);
+ }
+
+ @Benchmark
+ @Fork(
+ value = 1,
+ jvmArgsPrepend = {"--add-modules=jdk.incubator.vector"})
+ public int binarySquareVector() {
+ return VectorUtil.squareDistance(bytesA, bytesB);
+ }
+
+ @Benchmark
+ @Fork(value = 1)
+ public float floatCosineScalar() {
+ return VectorUtil.cosine(floatsA, floatsB);
+ }
+
+ @Benchmark
+ @Fork(
+ value = 1,
+ jvmArgsPrepend = {"--add-modules=jdk.incubator.vector"})
+ public float floatCosineVector() {
+ return VectorUtil.cosine(floatsA, floatsB);
+ }
+
+ @Benchmark
+ @Fork(value = 1)
+ public float floatDotProductScalar() {
+ return VectorUtil.dotProduct(floatsA, floatsB);
+ }
+
+ @Benchmark
+ @Fork(
+ value = 1,
+ jvmArgsPrepend = {"--add-modules=jdk.incubator.vector"})
+ public float floatDotProductVector() {
+ return VectorUtil.dotProduct(floatsA, floatsB);
+ }
+
+ @Benchmark
+ @Fork(value = 1)
+ public float floatSquareScalar() {
+ return VectorUtil.squareDistance(floatsA, floatsB);
+ }
+
+ @Benchmark
+ @Fork(
+ value = 1,
+ jvmArgsPrepend = {"--add-modules=jdk.incubator.vector"})
+ public float floatSquareVector() {
+ return VectorUtil.squareDistance(floatsA, floatsB);
+ }
+}