blob: 32ec93d2a4777f31a2899a7843a27939703920fe [file] [log] [blame]
/*
* 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 "bench/Benchmark.h"
#include "include/core/SkString.h"
#include "include/utils/SkRandom.h"
#include "src/gpu/GrTTopoSort.h"
#include "tools/ToolUtils.h"
class TopoSortBench : public Benchmark {
public:
TopoSortBench() { }
~TopoSortBench() override {
}
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 {
ToolUtils::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].get());
}
}
}
void onDraw(int loops, SkCanvas*) override {
for (int i = 0; i < loops; ++i) {
for (int j = 0; j < fGraph.count(); ++j) {
fGraph[j]->reset();
}
ToolUtils::TopoTestNode::Shuffle(&fGraph, &fRand);
SkDEBUGCODE(bool actualResult =) GrTTopoSort<ToolUtils::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;
SkTArray<sk_sp<ToolUtils::TopoTestNode>> fGraph;
SkRandom fRand;
using INHERITED = Benchmark;
};
///////////////////////////////////////////////////////////////////////////////
DEF_BENCH( return new TopoSortBench(); )