2016-07-12 22:01:26 +00:00
|
|
|
/*
|
|
|
|
* Copyright 2016 Google Inc.
|
|
|
|
*
|
|
|
|
* Use of this source code is governed by a BSD-style license that can be
|
|
|
|
* found in the LICENSE file.
|
|
|
|
*/
|
|
|
|
|
|
|
|
#include "Test.h"
|
|
|
|
#include "SkRasterPipeline.h"
|
|
|
|
|
2016-09-29 13:04:15 +00:00
|
|
|
static void SK_VECTORCALL load(SkRasterPipeline::Stage* st, size_t x, size_t tail,
|
|
|
|
Sk4f r, Sk4f g, Sk4f b, Sk4f a,
|
|
|
|
Sk4f dr, Sk4f dg, Sk4f db, Sk4f da) {
|
|
|
|
auto ptr = st->ctx<const float*>() + x;
|
2016-09-28 14:43:53 +00:00
|
|
|
switch(tail&3) {
|
|
|
|
case 0: a = Sk4f{ptr[3]};
|
|
|
|
case 3: b = Sk4f{ptr[2]};
|
|
|
|
case 2: g = Sk4f{ptr[1]};
|
|
|
|
case 1: r = Sk4f{ptr[0]};
|
|
|
|
}
|
2016-09-29 13:04:15 +00:00
|
|
|
st->next(x,tail, r,g,b,a, dr,dg,db,da);
|
2016-07-12 22:01:26 +00:00
|
|
|
}
|
|
|
|
|
2016-09-29 13:04:15 +00:00
|
|
|
static void SK_VECTORCALL square(SkRasterPipeline::Stage* st, size_t x, size_t tail,
|
|
|
|
Sk4f r, Sk4f g, Sk4f b, Sk4f a,
|
|
|
|
Sk4f dr, Sk4f dg, Sk4f db, Sk4f da) {
|
SkRasterPipeline: new APIs for fusion
Most visibly this adds a macro SK_RASTER_STAGE that cuts down on the boilerplate of defining a raster pipeline stage function.
Most interestingly, SK_RASTER_STAGE doesn't define a SkRasterPipeline::Fn, but rather a new type EasyFn. This function is always static and inlined, and the details of interacting with the SkRasterPipeline::Stage are taken care of for you: ctx is just passed as a void*, and st->next() is always called. All EasyFns have to do is take care of the meat of the work: update r,g,b, etc. and read and write from their context.
The really neat new feature here is that you can either add EasyFns to a pipeline with the new append() functions, _or_ call them directly yourself. This lets you use the same set of pieces to build either a pipelined version of the function or a custom, fused version. The bench shows this off.
On my desktop, the pipeline version of the bench takes about 25% more time to run than the fused one.
The old approach to creating stages still works fine. I haven't updated SkXfermode.cpp or SkArithmeticMode.cpp because they seemed just as clear using Fn directly as they would have using EasyFn.
If this looks okay to you I will rework the comments in SkRasterPipeline to explain SK_RASTER_STAGE and EasyFn a bit as I've done here in the CL description.
BUG=skia:
GOLD_TRYBOT_URL= https://gold.skia.org/search?issue=2195853002
Review-Url: https://codereview.chromium.org/2195853002
2016-07-29 21:27:41 +00:00
|
|
|
r *= r;
|
|
|
|
g *= g;
|
|
|
|
b *= b;
|
|
|
|
a *= a;
|
2016-09-29 13:04:15 +00:00
|
|
|
st->next(x,tail, r,g,b,a, dr,dg,db,da);
|
2016-07-12 22:01:26 +00:00
|
|
|
}
|
|
|
|
|
2016-09-29 13:04:15 +00:00
|
|
|
static void SK_VECTORCALL store(SkRasterPipeline::Stage* st, size_t x, size_t tail,
|
|
|
|
Sk4f r, Sk4f g, Sk4f b, Sk4f a,
|
|
|
|
Sk4f dr, Sk4f dg, Sk4f db, Sk4f da) {
|
|
|
|
auto ptr = st->ctx<float*>() + x;
|
2016-09-28 14:43:53 +00:00
|
|
|
switch (tail&3) {
|
|
|
|
case 0: ptr[3] = a[0];
|
|
|
|
case 3: ptr[2] = b[0];
|
|
|
|
case 2: ptr[1] = g[0];
|
|
|
|
case 1: ptr[0] = r[0];
|
|
|
|
}
|
2016-07-12 22:01:26 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
DEF_TEST(SkRasterPipeline, r) {
|
|
|
|
// We'll build up and run a simple pipeline that exercises the salient
|
|
|
|
// mechanics of SkRasterPipeline:
|
2016-09-28 14:43:53 +00:00
|
|
|
// - context pointers (load,store)
|
|
|
|
// - stages sensitive to the number of pixels (load,store)
|
|
|
|
// - stages insensitive to the number of pixels (square)
|
2016-09-29 13:04:15 +00:00
|
|
|
// - stages that chain to the next stage (load,square)
|
|
|
|
// - stages that terminate the pipeline (store)
|
2016-07-12 22:01:26 +00:00
|
|
|
//
|
|
|
|
// This pipeline loads up some values, squares them, then writes them back to memory.
|
|
|
|
|
|
|
|
const float src_vals[] = { 1,2,3,4,5 };
|
|
|
|
float dst_vals[] = { 0,0,0,0,0 };
|
|
|
|
|
|
|
|
SkRasterPipeline p;
|
2016-09-29 13:04:15 +00:00
|
|
|
p.append(load, src_vals);
|
|
|
|
p.append(square);
|
|
|
|
p.append(store, dst_vals);
|
2016-07-12 22:01:26 +00:00
|
|
|
|
|
|
|
p.run(5);
|
|
|
|
|
|
|
|
REPORTER_ASSERT(r, dst_vals[0] == 1);
|
|
|
|
REPORTER_ASSERT(r, dst_vals[1] == 4);
|
|
|
|
REPORTER_ASSERT(r, dst_vals[2] == 9);
|
|
|
|
REPORTER_ASSERT(r, dst_vals[3] == 16);
|
|
|
|
REPORTER_ASSERT(r, dst_vals[4] == 25);
|
|
|
|
}
|
2016-07-13 15:22:20 +00:00
|
|
|
|
|
|
|
DEF_TEST(SkRasterPipeline_empty, r) {
|
|
|
|
// No asserts... just a test that this is safe to run.
|
|
|
|
SkRasterPipeline p;
|
|
|
|
p.run(20);
|
|
|
|
}
|
|
|
|
|
|
|
|
DEF_TEST(SkRasterPipeline_nonsense, r) {
|
|
|
|
// No asserts... just a test that this is safe to run and terminates.
|
|
|
|
// square() always calls st->next(); this makes sure we've always got something there to call.
|
|
|
|
SkRasterPipeline p;
|
2016-09-29 13:04:15 +00:00
|
|
|
p.append(square);
|
2016-07-13 15:22:20 +00:00
|
|
|
p.run(20);
|
|
|
|
}
|