2019-06-13 15:23:57 +00:00
|
|
|
/*
|
|
|
|
* Copyright 2019 Google LLC
|
|
|
|
*
|
|
|
|
* 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/utils/SkRandom.h"
|
2019-06-14 14:17:16 +00:00
|
|
|
#include "src/sksl/SkSLByteCode.h"
|
2019-06-13 15:23:57 +00:00
|
|
|
#include "src/sksl/SkSLCompiler.h"
|
|
|
|
|
|
|
|
// Benchmarks the interpreter with a function that has a color-filter style signature
|
|
|
|
class SkSLInterpreterCFBench : public Benchmark {
|
|
|
|
public:
|
2019-06-19 15:40:33 +00:00
|
|
|
SkSLInterpreterCFBench(SkSL::String name, int pixels, bool striped, const char* src)
|
|
|
|
: fName(SkStringPrintf("sksl_interp_cf_%d_%d_%s", pixels, striped ? 1 : 0, name.c_str()))
|
2019-06-13 15:23:57 +00:00
|
|
|
, fSrc(src)
|
2019-06-19 15:40:33 +00:00
|
|
|
, fCount(pixels)
|
|
|
|
, fStriped(striped) {}
|
2019-06-13 15:23:57 +00:00
|
|
|
|
|
|
|
protected:
|
|
|
|
const char* onGetName() override {
|
|
|
|
return fName.c_str();
|
|
|
|
}
|
|
|
|
|
|
|
|
bool isSuitableFor(Backend backend) override {
|
|
|
|
return backend == kNonRendering_Backend;
|
|
|
|
}
|
|
|
|
|
|
|
|
void onDelayedSetup() override {
|
|
|
|
SkSL::Compiler compiler;
|
|
|
|
SkSL::Program::Settings settings;
|
|
|
|
auto program = compiler.convertProgram(SkSL::Program::kGeneric_Kind, fSrc, settings);
|
|
|
|
SkASSERT(compiler.errorCount() == 0);
|
|
|
|
fByteCode = compiler.toByteCode(*program);
|
|
|
|
SkASSERT(compiler.errorCount() == 0);
|
|
|
|
fMain = fByteCode->getFunction("main");
|
|
|
|
|
|
|
|
SkRandom rnd;
|
2019-06-14 14:17:16 +00:00
|
|
|
fPixels.resize(fCount * 4);
|
|
|
|
for (float& c : fPixels) {
|
|
|
|
c = rnd.nextF();
|
2019-06-13 15:23:57 +00:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
void onDraw(int loops, SkCanvas*) override {
|
|
|
|
for (int i = 0; i < loops; i++) {
|
2019-06-19 15:40:33 +00:00
|
|
|
if (fStriped) {
|
|
|
|
float* args[] = {
|
|
|
|
fPixels.data() + 0 * fCount,
|
|
|
|
fPixels.data() + 1 * fCount,
|
|
|
|
fPixels.data() + 2 * fCount,
|
|
|
|
fPixels.data() + 3 * fCount,
|
|
|
|
};
|
|
|
|
|
2019-07-18 21:00:34 +00:00
|
|
|
SkAssertResult(fByteCode->runStriped(fMain, args, 4, fCount,
|
|
|
|
nullptr, 0, nullptr, 0));
|
2019-06-19 15:40:33 +00:00
|
|
|
} else {
|
2019-07-18 21:00:34 +00:00
|
|
|
SkAssertResult(fByteCode->run(fMain, fPixels.data(), nullptr, fCount, nullptr, 0));
|
2019-06-19 15:40:33 +00:00
|
|
|
}
|
2019-06-13 15:23:57 +00:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
private:
|
|
|
|
SkString fName;
|
|
|
|
SkSL::String fSrc;
|
|
|
|
std::unique_ptr<SkSL::ByteCode> fByteCode;
|
|
|
|
const SkSL::ByteCodeFunction* fMain;
|
|
|
|
|
|
|
|
int fCount;
|
2019-06-19 15:40:33 +00:00
|
|
|
bool fStriped;
|
2019-06-14 14:17:16 +00:00
|
|
|
std::vector<float> fPixels;
|
2019-06-13 15:23:57 +00:00
|
|
|
|
|
|
|
typedef Benchmark INHERITED;
|
|
|
|
};
|
|
|
|
|
|
|
|
///////////////////////////////////////////////////////////////////////////////
|
|
|
|
|
2019-06-19 15:40:33 +00:00
|
|
|
const char* kLumaToAlphaSrc = R"(
|
2019-06-13 15:23:57 +00:00
|
|
|
void main(inout float4 color) {
|
|
|
|
color.a = color.r*0.3 + color.g*0.6 + color.b*0.1;
|
|
|
|
color.r = 0;
|
|
|
|
color.g = 0;
|
|
|
|
color.b = 0;
|
|
|
|
}
|
2019-06-19 15:40:33 +00:00
|
|
|
)";
|
2019-06-13 15:23:57 +00:00
|
|
|
|
2019-06-19 15:40:33 +00:00
|
|
|
const char* kHighContrastFilterSrc = R"(
|
2019-06-13 15:23:57 +00:00
|
|
|
half ucontrast_Stage2;
|
|
|
|
half hue2rgb_Stage2(half p, half q, half t) {
|
|
|
|
if (t < 0) t += 1;
|
|
|
|
if (t > 1) t -= 1;
|
2019-07-12 15:30:32 +00:00
|
|
|
return (t < 1 / 6.) ? p + (q - p) * 6 * t
|
|
|
|
: (t < 1 / 2.) ? q
|
|
|
|
: (t < 2 / 3.) ? p + (q - p) * (2 / 3. - t) * 6
|
|
|
|
: p;
|
2019-06-13 15:23:57 +00:00
|
|
|
}
|
|
|
|
half max(half a, half b) { return a > b ? a : b; }
|
|
|
|
half min(half a, half b) { return a < b ? a : b; }
|
|
|
|
void main(inout half4 color) {
|
|
|
|
ucontrast_Stage2 = 0.2;
|
|
|
|
|
|
|
|
// HighContrastFilter
|
|
|
|
half nonZeroAlpha = max(color.a, 0.0001);
|
|
|
|
color = half4(color.rgb / nonZeroAlpha, nonZeroAlpha);
|
|
|
|
color.rgb = color.rgb * color.rgb;
|
|
|
|
half fmax = max(color.r, max(color.g, color.b));
|
|
|
|
half fmin = min(color.r, min(color.g, color.b));
|
|
|
|
half l = (fmax + fmin) / 2;
|
|
|
|
half h;
|
|
|
|
half s;
|
|
|
|
if (fmax == fmin) {
|
|
|
|
h = 0;
|
|
|
|
s = 0;
|
|
|
|
} else {
|
|
|
|
half d = fmax - fmin;
|
|
|
|
s = l > 0.5 ? d / (2 - fmax - fmin) : d / (fmax + fmin);
|
|
|
|
if (color.r >= color.g && color.r >= color.b) {
|
|
|
|
h = (color.g - color.b) / d + (color.g < color.b ? 6 : 0);
|
|
|
|
} else if (color.g >= color.b) {
|
|
|
|
h = (color.b - color.r) / d + 2;
|
|
|
|
} else {
|
|
|
|
h = (color.r - color.g) / d + 4;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
h /= 6;
|
|
|
|
l = 1.0 - l;
|
|
|
|
if (s == 0) {
|
|
|
|
color = half4(l, l, l, 0);
|
|
|
|
} else {
|
|
|
|
half q = l < 0.5 ? l * (1 + s) : l + s - l * s;
|
|
|
|
half p = 2 * l - q;
|
|
|
|
color.r = hue2rgb_Stage2(p, q, h + 1 / 3.);
|
|
|
|
color.g = hue2rgb_Stage2(p, q, h);
|
|
|
|
color.b = hue2rgb_Stage2(p, q, h - 1 / 3.);
|
|
|
|
}
|
|
|
|
if (ucontrast_Stage2 != 0) {
|
|
|
|
half m = (1 + ucontrast_Stage2) / (1 - ucontrast_Stage2);
|
|
|
|
half off = (-0.5 * m + 0.5);
|
|
|
|
color = m * color + off;
|
|
|
|
}
|
|
|
|
// color = saturate(color);
|
|
|
|
color.rgb = sqrt(color.rgb);
|
|
|
|
color.rgb *= color.a;
|
|
|
|
}
|
2019-06-19 15:40:33 +00:00
|
|
|
)";
|
|
|
|
|
|
|
|
DEF_BENCH(return new SkSLInterpreterCFBench("lumaToAlpha", 256, false, kLumaToAlphaSrc));
|
|
|
|
DEF_BENCH(return new SkSLInterpreterCFBench("lumaToAlpha", 256, true, kLumaToAlphaSrc));
|
|
|
|
|
|
|
|
DEF_BENCH(return new SkSLInterpreterCFBench("hcf", 256, false, kHighContrastFilterSrc));
|
|
|
|
DEF_BENCH(return new SkSLInterpreterCFBench("hcf", 256, true, kHighContrastFilterSrc));
|
2019-06-13 15:23:57 +00:00
|
|
|
|
|
|
|
class SkSLInterpreterSortBench : public Benchmark {
|
|
|
|
public:
|
|
|
|
SkSLInterpreterSortBench(int groups, int values, const char* src)
|
|
|
|
: fName(SkStringPrintf("sksl_interp_sort_%dx%d", groups, values))
|
|
|
|
, fCode(src)
|
|
|
|
, fGroups(groups)
|
|
|
|
, fValues(values) {
|
|
|
|
}
|
|
|
|
|
|
|
|
protected:
|
|
|
|
const char* onGetName() override {
|
|
|
|
return fName.c_str();
|
|
|
|
}
|
|
|
|
|
|
|
|
bool isSuitableFor(Backend backend) override {
|
|
|
|
return backend == kNonRendering_Backend;
|
|
|
|
}
|
|
|
|
|
|
|
|
void onDelayedSetup() override {
|
|
|
|
SkSL::Compiler compiler;
|
|
|
|
SkSL::Program::Settings settings;
|
|
|
|
auto program = compiler.convertProgram(SkSL::Program::kGeneric_Kind, fCode, settings);
|
|
|
|
SkASSERT(compiler.errorCount() == 0);
|
|
|
|
fByteCode = compiler.toByteCode(*program);
|
|
|
|
SkASSERT(compiler.errorCount() == 0);
|
|
|
|
fMain = fByteCode->getFunction("main");
|
|
|
|
|
|
|
|
fSrc.resize(fGroups * fValues);
|
|
|
|
fDst.resize(fGroups * fValues);
|
|
|
|
|
|
|
|
SkRandom rnd;
|
2019-06-14 14:17:16 +00:00
|
|
|
for (float& x : fSrc) {
|
|
|
|
x = rnd.nextF();
|
2019-06-13 15:23:57 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
// Trigger one run now to check correctness
|
2019-07-18 21:00:34 +00:00
|
|
|
SkAssertResult(fByteCode->run(fMain, fSrc.data(), fDst.data(), fGroups, nullptr, 0));
|
2019-06-13 15:23:57 +00:00
|
|
|
for (int i = 0; i < fGroups; ++i) {
|
|
|
|
for (int j = 1; j < fValues; ++j) {
|
|
|
|
SkASSERT(fDst[i * fValues + j] >= fDst[i * fValues + j - 1]);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
void onDraw(int loops, SkCanvas*) override {
|
|
|
|
for (int i = 0; i < loops; i++) {
|
2019-07-18 21:00:34 +00:00
|
|
|
SkAssertResult(fByteCode->run(fMain, fSrc.data(), fDst.data(), fGroups, nullptr, 0));
|
2019-06-13 15:23:57 +00:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
private:
|
|
|
|
SkString fName;
|
|
|
|
SkSL::String fCode;
|
|
|
|
std::unique_ptr<SkSL::ByteCode> fByteCode;
|
|
|
|
const SkSL::ByteCodeFunction* fMain;
|
|
|
|
|
|
|
|
int fGroups;
|
|
|
|
int fValues;
|
2019-06-14 14:17:16 +00:00
|
|
|
std::vector<float> fSrc;
|
|
|
|
std::vector<float> fDst;
|
2019-06-13 15:23:57 +00:00
|
|
|
|
|
|
|
typedef Benchmark INHERITED;
|
|
|
|
};
|
|
|
|
|
|
|
|
// Currently, this exceeds the interpreter's stack. Consider it a test case for some eventual
|
|
|
|
// bounds checking.
|
|
|
|
#if 0
|
|
|
|
DEF_BENCH(return new SkSLInterpreterSortBench(1024, 32, R"(
|
2019-06-14 14:17:16 +00:00
|
|
|
float[32] main(float v[32]) {
|
2019-06-13 15:23:57 +00:00
|
|
|
for (int i = 1; i < 32; ++i) {
|
|
|
|
for (int j = i; j > 0 && v[j-1] > v[j]; --j) {
|
2019-06-14 14:17:16 +00:00
|
|
|
float t = v[j];
|
2019-06-13 15:23:57 +00:00
|
|
|
v[j] = v[j-1];
|
|
|
|
v[j-1] = t;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
return v;
|
|
|
|
}
|
|
|
|
)"));
|
|
|
|
#endif
|