aboutsummaryrefslogtreecommitdiffhomepage
path: root/bench/TopoSortBench.cpp
diff options
context:
space:
mode:
authorGravatar robertphillips <robertphillips@google.com>2015-10-19 12:15:55 -0700
committerGravatar Commit bot <commit-bot@chromium.org>2015-10-19 12:15:55 -0700
commit423f6461e98ba28730d05e5894804a4970a09bde (patch)
treef6699e026fc9f2c763296d999cdf63f92cc432c0 /bench/TopoSortBench.cpp
parentbc0bcc08b390e430f66710ddfbc47da39ab841d9 (diff)
Add SkTTopoSort
Diffstat (limited to 'bench/TopoSortBench.cpp')
-rw-r--r--bench/TopoSortBench.cpp79
1 files changed, 79 insertions, 0 deletions
diff --git a/bench/TopoSortBench.cpp b/bench/TopoSortBench.cpp
new file mode 100644
index 0000000000..3fa1c0ff97
--- /dev/null
+++ b/bench/TopoSortBench.cpp
@@ -0,0 +1,79 @@
+/*
+ * Copyright 2015 Google Inc.
+ *
+ * Use of this source code is governed by a BSD-style license that can be
+ * found in the LICENSE file.
+ */
+
+#include "Benchmark.h"
+#include "SkRandom.h"
+#include "SkString.h"
+#include "SkTTopoSort.h"
+
+#include "sk_tool_utils.h"
+
+class TopoSortBench : public Benchmark {
+public:
+ TopoSortBench() { }
+
+ ~TopoSortBench() override {
+ sk_tool_utils::TopoTestNode::DeallocNodes(&fGraph);
+ }
+
+ bool isSuitableFor(Backend backend) override {
+ return kNonRendering_Backend == backend;
+ }
+
+protected:
+ const char* onGetName() override {
+ return "sort_topo_rand";
+ }
+
+ // Delayed initialization only done if onDraw will be called.
+ void onDelayedSetup() override {
+ sk_tool_utils::TopoTestNode::AllocNodes(&fGraph, kNumElements);
+
+ for (int i = kNumElements-1; i > 0; --i) {
+ int numEdges = fRand.nextU() % (kMaxEdges+1);
+
+ for (int j = 0; j < numEdges; ++j) {
+ int dep = fRand.nextU() % i;
+
+ fGraph[i]->dependsOn(fGraph[dep]);
+ }
+ }
+ }
+
+ void onDraw(int loops, SkCanvas*) override {
+ for (int i = 0; i < loops; ++i) {
+ for (int j = 0; j < fGraph.count(); ++j) {
+ fGraph[j]->reset();
+ }
+
+ sk_tool_utils::TopoTestNode::Shuffle(&fGraph, &fRand);
+
+ SkDEBUGCODE(bool actualResult =) SkTTopoSort<sk_tool_utils::TopoTestNode>(&fGraph);
+ SkASSERT(actualResult);
+
+#ifdef SK_DEBUG
+ for (int j = 0; j < fGraph.count(); ++j) {
+ SkASSERT(fGraph[j]->check());
+ }
+#endif
+ }
+ }
+
+private:
+ static const int kNumElements = 1000;
+ static const int kMaxEdges = 5;
+
+ SkTDArray<sk_tool_utils::TopoTestNode*> fGraph;
+ SkRandom fRand;
+
+ typedef Benchmark INHERITED;
+};
+
+///////////////////////////////////////////////////////////////////////////////
+
+DEF_BENCH( return new TopoSortBench(); )
+