7c0200a8e2
GrStrokeHardwareTessellator is the only user that needs to simply check if a cusp exists at all. Making the check local speeds up the microbench from 502us -> 392. Bug: chromium:1172543 Change-Id: I52adf9ef0a66e1267435e6ce41f01ee1eda17d7a Reviewed-on: https://skia-review.googlesource.com/c/skia/+/373744 Reviewed-by: Greg Daniel <egdaniel@google.com> Reviewed-by: John Stiles <johnstiles@google.com> Commit-Queue: Chris Dalton <csmartdalton@google.com>
39 lines
1.3 KiB
C++
39 lines
1.3 KiB
C++
/*
|
|
* Copyright 2020 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 "src/gpu/geometry/GrPathUtils.h"
|
|
|
|
class FindCubicConvex180Chops : public Benchmark {
|
|
public:
|
|
FindCubicConvex180Chops(const std::array<SkPoint,4>& pts, const char* suffix) : fPts(pts) {
|
|
fName.printf("GrPathUtils_findCubicConvex180Chops%s", suffix);
|
|
}
|
|
|
|
private:
|
|
const char* onGetName() override { return fName.c_str(); }
|
|
bool isSuitableFor(Backend backend) final { return backend == kNonRendering_Backend; }
|
|
void onDraw(int loops, SkCanvas*) final {
|
|
float T[2] = {0};
|
|
bool areCusps;
|
|
int iters = 50000 * loops;
|
|
for (int i = 0; i < iters; ++i) {
|
|
int count = GrPathUtils::findCubicConvex180Chops(fPts.data(), T, &areCusps);
|
|
if (T[0] == 200.7f) {
|
|
// This will never happen. Pretend to use the result to keep the compiler honest.
|
|
SkDebugf("%i%f%f", count, T[0], T[1]);
|
|
}
|
|
}
|
|
}
|
|
|
|
SkString fName;
|
|
std::array<SkPoint,4> fPts;
|
|
};
|
|
|
|
DEF_BENCH(return new FindCubicConvex180Chops({{{0,0}, {100,0}, {50,100}, {100,100}}}, "_inflect1");)
|
|
DEF_BENCH(return new FindCubicConvex180Chops({{{0,0}, {50,0}, {100,50}, {100,100}}}, "_loop");)
|