[WIP] perf tests (#40)

* special maxpool test Signed-off-by: raver119 <raver119@gmail.com> * special maxpool test Signed-off-by: raver119 <raver119@gmail.com>
2019-11-11 17:45:59 +03:00 · 2019-11-11 17:45:59 +03:00 · cd961727bb
parent 6958f2ba24
commit cd961727bb
1 changed files with 90 additions and 0 deletions
--- a/libnd4j/tests_cpu/layers_tests/PerformanceTests.cpp
+++ b/libnd4j/tests_cpu/layers_tests/PerformanceTests.cpp
@ -0,0 +1,90 @@
+/*******************************************************************************
+ * Copyright (c) 2019 Konduit
+ *
+ * This program and the accompanying materials are made available under the
+ * terms of the Apache License, Version 2.0 which is available at
+ * https://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.
+ *
+ * SPDX-License-Identifier: Apache-2.0
+ ******************************************************************************/
+
+//
+// @author raver119@gmail.com
+//
+
+#include "testlayers.h"
+#include <Graph.h>
+#include <chrono>
+#include <Node.h>
+#include <ops/declarable/CustomOperations.h>
+#include <graph/profiling/GraphProfilingHelper.h>
+#include <type_conversions.h>
+#include <helpers/threshold.h>
+#include <helpers/MmulHelper.h>
+#include <ops/ops.h>
+#include <OmpLaunchHelper.h>
+#include <GradCheck.h>
+#include <ops/declarable/helpers/im2col.h>
+#include <Loops.h>
+#include <RandomLauncher.h>
+
+#include <helpers/BenchmarkHelper.h>
+#include <ops/declarable/helpers/scatter.h>
+#include <helpers/ConstantShapeHelper.h>
+#include <helpers/ConstantTadHelper.h>
+#include <array>
+#include <performance/benchmarking/FullBenchmarkSuit.h>
+#include <performance/benchmarking/LightBenchmarkSuit.h>
+
+#include <ops/declarable/helpers/legacy_helpers.h>
+
+using namespace nd4j;
+using namespace nd4j::graph;
+
+class PerformanceTests : public testing::Test {
+public:
+    int numIterations = 100;
+
+    PerformanceTests() {
+        //
+    }
+};
+
+#ifdef RELEASE_BUILD
+
+TEST_F(PerformanceTests, test_maxpooling2d_1) {
+    std::vector<Nd4jLong> valuesX;
+    auto x = NDArrayFactory::create<float>('c', {32, 3, 224, 224});
+    auto z = NDArrayFactory::create<float>('c', {32, 3, 224, 224});
+    x.linspace(1.0f);
+    Nd4jLong k = 5;
+
+    Nd4jLong iArgs[] {k,k, 1,1, 0,0, 1,1, 1};
+    Context ctx(1);
+    ctx.setInputArray(0, &x);
+    ctx.setOutputArray(0, &z);
+    ctx.setIArguments(iArgs, 9);
+
+    nd4j::ops::maxpool2d op;
+
+    for (int i = 0; i < numIterations; i++) {
+        auto timeStart = std::chrono::system_clock::now();
+
+        op.execute(&ctx);
+
+        auto timeEnd = std::chrono::system_clock::now();
+        auto outerTime = std::chrono::duration_cast<std::chrono::nanoseconds>(timeEnd - timeStart).count();
+        valuesX.emplace_back(outerTime);
+    }
+
+    std::sort(valuesX.begin(), valuesX.end());
+    nd4j_printf("Execution time: %lld; Min: %lld; Max: %lld;\n", valuesX[valuesX.size() / 2], valuesX[0], valuesX[valuesX.size() - 1]);
+}
+
+#endif